{"id":"https://openalex.org/W2081931693","doi":"https://doi.org/10.1109/tit.1974.1055222","title":"Some long cyclic linear binary codes are not so bad","display_name":"Some long cyclic linear binary codes are not so bad","publication_year":1974,"publication_date":"1974-05-01","ids":{"openalex":"https://openalex.org/W2081931693","doi":"https://doi.org/10.1109/tit.1974.1055222","mag":"2081931693"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1974.1055222","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1974.1055222","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/A5090352309","display_name":"Elwyn R. Berlekamp","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Berlekamp","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113536808","display_name":"J. Justesen","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Justesen","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":8.839,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.97334281,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"20","issue":"3","first_page":"351","last_page":"356"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"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.9997000098228455,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9965999722480774,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9879999756813049,"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/binary-number","display_name":"Binary number","score":0.6151530742645264},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.5730828046798706},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.49854040145874023},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.4710257947444916},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4655607044696808},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4653385877609253},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4517388641834259},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39261379837989807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34211891889572144},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.33331459760665894},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32954657077789307},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.20625004172325134},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.18121495842933655},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1088557243347168},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0719541609287262}],"concepts":[{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6151530742645264},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.5730828046798706},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.49854040145874023},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.4710257947444916},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4655607044696808},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4653385877609253},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4517388641834259},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39261379837989807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34211891889572144},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.33331459760665894},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32954657077789307},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.20625004172325134},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.18121495842933655},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1088557243347168},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0719541609287262},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1974.1055222","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1974.1055222","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W189366260","https://openalex.org/W1537824340","https://openalex.org/W1984086498","https://openalex.org/W1998064108","https://openalex.org/W2001087001","https://openalex.org/W2003282073","https://openalex.org/W2014860393","https://openalex.org/W2014944833","https://openalex.org/W2026561832","https://openalex.org/W2028984939","https://openalex.org/W2037201304","https://openalex.org/W2081016423","https://openalex.org/W2084035360","https://openalex.org/W2125296084","https://openalex.org/W2152530247","https://openalex.org/W2182112064","https://openalex.org/W2317565009","https://openalex.org/W6607706861"],"related_works":["https://openalex.org/W1986274407","https://openalex.org/W2896263022","https://openalex.org/W2084553348","https://openalex.org/W2035513039","https://openalex.org/W2249337672","https://openalex.org/W4248511311","https://openalex.org/W2366009615","https://openalex.org/W2041046759","https://openalex.org/W2902598753","https://openalex.org/W2026561832"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,160],"when":[3],"an":[4,12,19],"inner":[5,60],"linear":[6,44,70,121,133],"cyclic":[7,30,45,71],"binary":[8,46,72],"code":[9,28,61],"which":[10,48,98,128,200],"has":[11],"irreducible":[13],"check":[14],"polynomial":[15],"is":[16,29,129,188,205],"concatenated":[17,134],"with":[18,101,125,131,144],"appropriately":[20],"chosen":[21],"maximal-distance-separable":[22],"outer":[23],"code,":[24,67],"then":[25],"the":[26,59,102,120,171,175,180,191,201],"overall":[27],"Over":[31],"<tex":[32,76,81,87,105,149,196,206],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[33,77,82,88,106,150,197,207],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">GF(2)</tex>":[34],".":[35,211],"Using":[36],"this":[37,137,167],"theorem,":[38],"we":[39,68,153],"construct":[40],"a":[41,64],"number":[42],"of":[43,74,123,166,182,185,193,203],"codes":[47,73,165,184],"are":[49,162],"better":[50],"than":[51,148],"any":[52],"previously":[53],"known.":[54],"In":[55],"particular,":[56],"by":[57],"taking":[58],"to":[62,118,158,190],"be":[63],"quadratic":[65],"residue":[66],"obtain":[69],"length":[75,127],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">N</tex>":[78],",":[79,84,97,113,152],"rate":[80],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">R</tex>":[83],"and":[85],"distance":[86,104,124],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">D":[89,107],"\\geq":[90],"(1":[91],"-":[92,209],"2R)N/":[93],"\\sqrt{2":[94],"\\log":[95],"N}</tex>":[96],"compares":[99],"favorably":[100],"BCH":[103],"\\sim":[108],"(2":[109],"\\ln":[110],"R^{-1})N/\\log":[111],"N</tex>":[112],"although":[114],"it":[115],"still":[116],"fails":[117],"achieve":[119],"growth":[122],"block":[126,145],"possible":[130],"noncyclic":[132],"codes.":[135],"While":[136],"construction":[138],"yields":[139],"many":[140],"codes,":[141],"including":[142],"several":[143],"lengths":[146],"greater":[147],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">10^{10^5}</tex>":[151],"have":[154],"not":[155],"been":[156],"able":[157],"prove":[159],"there":[161],"arbitrarily":[163],"long":[164,183],"type":[168,187],"without":[169],"invoking":[170],"Riemann":[172],"hypothesis":[173],"or":[174],"revised":[176],"Artin":[177],"conjecture,":[178],"as":[179],"existence":[181,192],"our":[186],"equivalent":[189],"large":[194],"primes":[195],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">p</tex>":[198],"for":[199],"index":[202],"2":[204],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">(p":[208],"1)/2</tex>":[210]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}