{"id":"https://openalex.org/W2155469840","doi":"https://doi.org/10.1109/tit.1967.1053974","title":"Self-orthogonal quasi-cyclic codes","display_name":"Self-orthogonal quasi-cyclic codes","publication_year":1967,"publication_date":"1967-04-01","ids":{"openalex":"https://openalex.org/W2155469840","doi":"https://doi.org/10.1109/tit.1967.1053974","mag":"2155469840"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1967.1053974","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1967.1053974","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/A5035713477","display_name":"R. L. Townsend","orcid":null},"institutions":[{"id":"https://openalex.org/I4388482701","display_name":"Applied Research Laboratory at the University of Hawai\u2018i","ror":"https://ror.org/046s2rf49","country_code":null,"type":"facility","lineage":["https://openalex.org/I4388482701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Townsend","raw_affiliation_strings":["Applied Research Laboratory, Sylvania Electronics Systems, Inc., Waltham, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Applied Research Laboratory, Sylvania Electronics Systems, Inc., Waltham, MA, USA","institution_ids":["https://openalex.org/I4388482701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023980396","display_name":"Edward Weldon","orcid":"https://orcid.org/0000-0002-0493-9344"},"institutions":[{"id":"https://openalex.org/I1331384533","display_name":"University of Hawaii System","ror":"https://ror.org/03tzaeb71","country_code":"US","type":"education","lineage":["https://openalex.org/I1331384533"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Weldon","raw_affiliation_strings":["University of Hawai, Honolulu, HI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hawai, Honolulu, HI, USA","institution_ids":["https://openalex.org/I1331384533"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.215,"has_fulltext":false,"cited_by_count":164,"citation_normalized_percentile":{"value":0.97013598,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"2","first_page":"183","last_page":"195"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9961000084877014,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9937999844551086,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.8224566578865051},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.7170871496200562},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.7004209756851196},{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.5463271141052246},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5142247676849365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5135798454284668},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5066254734992981},{"id":"https://openalex.org/keywords/luby-transform-code","display_name":"Luby transform code","score":0.45423904061317444},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4541350305080414},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.41491183638572693},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4109940528869629},{"id":"https://openalex.org/keywords/bcjr-algorithm","display_name":"BCJR algorithm","score":0.4104546308517456},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38618433475494385},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3415396213531494},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3358750343322754}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.8224566578865051},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.7170871496200562},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.7004209756851196},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.5463271141052246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5142247676849365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5135798454284668},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5066254734992981},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.45423904061317444},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4541350305080414},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.41491183638572693},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4109940528869629},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.4104546308517456},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38618433475494385},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3415396213531494},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3358750343322754}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1967.1053974","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1967.1053974","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":19,"referenced_works":["https://openalex.org/W567613705","https://openalex.org/W2030243808","https://openalex.org/W2048731540","https://openalex.org/W2064759901","https://openalex.org/W2083774980","https://openalex.org/W2148948564","https://openalex.org/W2315690892","https://openalex.org/W2729833357","https://openalex.org/W3110949823","https://openalex.org/W3138350084","https://openalex.org/W3216147140","https://openalex.org/W4234803039","https://openalex.org/W4238661777","https://openalex.org/W4245256025","https://openalex.org/W4285719527","https://openalex.org/W6740269883","https://openalex.org/W6787442083","https://openalex.org/W6792513039","https://openalex.org/W6804434002"],"related_works":["https://openalex.org/W1487439089","https://openalex.org/W165186219","https://openalex.org/W1966899942","https://openalex.org/W2025803580","https://openalex.org/W2041319252","https://openalex.org/W2115550046","https://openalex.org/W2082570149","https://openalex.org/W2077939208","https://openalex.org/W2460434904","https://openalex.org/W2160118466"],"abstract_inverted_index":{"A":[0,58],"new":[1],"class":[2],"of":[3,19,28,38,60,67,84,87,106,148,150,158],"linear":[4],"block":[5],"codes,":[6,10,142],"called":[7],"self-orthogonal":[8],"quasi-cyclic":[9],"is":[11,14,23,62,95],"defined.":[12],"It":[13],"shown":[15],"that":[16],"the":[17,26,85,91,104,107,117,122,129,140,143,151],"problem":[18,27],"designing":[20,29],"these":[21,110,133],"codes":[22,42,49,61,89,111,120,134],"equivalent":[24],"to":[25,139,154],"disjoint":[30],"difference":[31],"sets.":[32],"As":[33],"a":[34,54,80],"result,":[35],"several":[36,88],"classes":[37],"optimal":[39],"and":[40,47,70,79,126,146],"near-optimal":[41],"can":[43,50],"be":[44,51,136],"constructed":[45],"analytically":[46],"other":[48],"found":[52],"by":[53],"computer-aided":[55],"search":[56],"procedure.":[57],"list":[59],"given":[63],"for":[64,164],"practical":[65,165],"values":[66],"minimum":[68,124],"distance":[69,125],"efficiency.":[71],"Two":[72],"easily":[73],"implemented":[74],"decoding":[75],"algorithms":[76],"are":[77],"described,":[78],"Monte":[81],"Carlo":[82],"evaluation":[83,98],"performance":[86],"on":[90],"binary":[92],"symmetric":[93],"channel":[94],"presented.":[96],"This":[97],"shows":[99],"that,":[100],"when":[101],"decoded":[102],"with":[103,121],"better":[105],"two":[108],"algorithms,":[109],"perform":[112],"nearly":[113],"as":[114,116],"well":[115],"Bose-Chaudhuri-Hocquenghem":[118],"(BCH)":[119],"same":[123],"efficiency":[127],"in":[128],"cases":[130],"examined.":[131],"Although":[132],"must":[135],"long":[137],"relative":[138],"BCH":[141],"low":[144],"cost":[145],"lack":[147],"complexity":[149],"equipment":[152],"required":[153],"correct":[155],"large":[156],"numbers":[157],"errors":[159],"should":[160],"make":[161],"them":[162],"competitive":[163],"systems.":[166]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":9}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}