{"id":"https://openalex.org/W2144730981","doi":"https://doi.org/10.1109/tit.1983.1056753","title":"Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes","display_name":"Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes","publication_year":1983,"publication_date":"1983-11-01","ids":{"openalex":"https://openalex.org/W2144730981","doi":"https://doi.org/10.1109/tit.1983.1056753","mag":"2144730981"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1983.1056753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056753","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5000405798","display_name":"W. van Gils","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122849","display_name":"Philips (Netherlands)","ror":"https://ror.org/02p2bgp27","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210122849"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"W. van Gils","raw_affiliation_strings":["Department of Mathematics and Computing Science, Eindhovan University of Technology, Eindhoven, Netherlands","Philips Research Laboratories, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Eindhovan University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Philips Research Laboratories, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I4210122849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000405798"],"corresponding_institution_ids":["https://openalex.org/I4210122849","https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":5.7351,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.96292675,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"29","issue":"6","first_page":"866","last_page":"876"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.7290688753128052},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.726148784160614},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6666682362556458},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.602859377861023},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.542536199092865},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.538148045539856},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5353264212608337},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.46800580620765686},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.46723467111587524},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.46392354369163513},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.44244030117988586},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43822023272514343},{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.4288787245750427},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.4199889600276947},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39953890442848206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3865399956703186},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.20476627349853516}],"concepts":[{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.7290688753128052},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.726148784160614},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6666682362556458},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.602859377861023},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.542536199092865},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.538148045539856},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5353264212608337},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.46800580620765686},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.46723467111587524},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.46392354369163513},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.44244030117988586},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43822023272514343},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.4288787245750427},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.4199889600276947},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39953890442848206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3865399956703186},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.20476627349853516},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1983.1056753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056753","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1965435948","https://openalex.org/W2069942572","https://openalex.org/W2119995058","https://openalex.org/W2156452863","https://openalex.org/W4245256025"],"related_works":["https://openalex.org/W2111330432","https://openalex.org/W1557234699","https://openalex.org/W2290229330","https://openalex.org/W2371410523","https://openalex.org/W2039633855","https://openalex.org/W1524903565","https://openalex.org/W2157171589","https://openalex.org/W165186219","https://openalex.org/W2115550046","https://openalex.org/W645598334"],"abstract_inverted_index":{"It":[0],"is":[1,21,72],"possible":[2],"for":[3,12,64],"a":[4,48,53,93],"linear":[5,37],"block":[6],"code":[7,50],"to":[8],"provide":[9],"more":[10],"protection":[11,40,57],"selected":[13],"positions":[14],"in":[15],"the":[16,24,28,45],"input":[17],"message":[18],"words":[19],"than":[20,82,104],"guaranteed":[22],"by":[23],"minimum":[25],"distance":[26],"of":[27,47,67,76,79,87,95,101],"code.":[29],"Linear":[30],"codes":[31,71,86,100],"having":[32],"this":[33],"property":[34],"are":[35,58,106],"called":[36],"unequal":[38,55],"error":[39,56],"(LUEP)":[41],"codes.":[42],"Bounds":[43],"on":[44],"length":[46,80,91,102],"LUEP":[49,85],"that":[51],"ensures":[52],"given":[54],"derived.":[59],"A":[60,74],"majority":[61],"decoding":[62],"method":[63],"certain":[65],"classes":[66],"cyclic":[68,97],"binary":[69,84,98],"UEP":[70,99],"treated.":[73],"list":[75,94],"short":[77],"(i.e.,":[78,89],"less":[81,103],"16)":[83],"optimal":[88],"minimal)":[90],"and":[92],"all":[96],"40":[105],"included.":[107]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}