{"id":"https://openalex.org/W2149194506","doi":null,"title":"TERNARY TREE & A CODING TECHNIQUE","display_name":"TERNARY TREE & A CODING TECHNIQUE","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2149194506","mag":"2149194506"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.628.5945","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.628.5945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://paper.ijcsns.org/07_book/200810/20081015.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028881411","display_name":"Madhu Goel","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Madhu Goel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5028881411"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.265,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76441516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":92},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ternary-trees","display_name":"ternary trees","score":0.9980000257492065},{"id":"https://openalex.org/keywords/binary-trees","display_name":"binary trees","score":0.8920000195503235},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.953000009059906},{"id":"https://openalex.org/keywords/data-compression","display_name":"data compression","score":0.9850000143051147},{"id":"https://openalex.org/keywords/error-detection","display_name":"error detection","score":0.8040000200271606},{"id":"https://openalex.org/keywords/error-correction","display_name":"error correction","score":0.9160000085830688},{"id":"https://openalex.org/keywords/search-efficiency","display_name":"search efficiency","score":0.4129999876022339}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.8280491828918457},{"id":"https://openalex.org/C64452783","wikidata":"https://www.wikidata.org/wiki/Q1524945","display_name":"Ternary operation","level":2,"score":0.7186501026153564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6479048132896423},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.6209343671798706},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4905983507633209},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.45411232113838196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4520074427127838},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3816356062889099},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.26159465312957764},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.23843884468078613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23344209790229797},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1012190580368042},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09811213612556458},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.08628383278846741}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.628.5945","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.628.5945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://paper.ijcsns.org/07_book/200810/20081015.pdf","raw_type":"text"},{"id":"mag:2149194506","doi":null,"is_oa":false,"landing_page_url":"http://paper.ijcsns.org/07_book/200810/20081015.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1484014009","https://openalex.org/W1981134600","https://openalex.org/W2060108852","https://openalex.org/W2080767424","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W2339233612","https://openalex.org/W2146339427","https://openalex.org/W7099101926","https://openalex.org/W2188010542","https://openalex.org/W2884886165","https://openalex.org/W2577009374","https://openalex.org/W2021061482","https://openalex.org/W7155386758","https://openalex.org/W7100914815","https://openalex.org/W2347638464"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"the":[3,7,20],"focus":[4],"is":[5,29],"on":[6],"use":[8],"of":[9,16],"Ternary":[10,24],"Trees":[11],"over":[12],"Binary":[13],"Tress.":[14],"First":[15],"all,":[17],"we":[18],"give":[19],"memory":[21],"representation":[22],"for":[23],"Trees.":[25],"Huffman":[26],"coding":[27],"technique":[28],"developed":[30],"using":[31],"ternary":[32],"trees,":[33],"which":[34],"benefits":[35],"in":[36],"computer":[37],"implementation,":[38],"efficient":[39],"memory,":[40],"compression,":[41],"fast":[42],"searching":[43],"and":[44],"error":[45,48],"detecting":[46],"&":[47],"correcting.":[49],"Keywords:":[50]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2016-06-24T00:00:00"}