{"id":"https://openalex.org/W2159741270","doi":"https://doi.org/10.1109/tit.1972.1054904","title":"A new description of the Nadler code (Corresp.)","display_name":"A new description of the Nadler code (Corresp.)","publication_year":1972,"publication_date":"1972-11-01","ids":{"openalex":"https://openalex.org/W2159741270","doi":"https://doi.org/10.1109/tit.1972.1054904","mag":"2159741270"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1972.1054904","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1972.1054904","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":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/13e82911-3267-40f6-9d87-d2926f451ca5","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110264743","display_name":"JH van Lint","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. van Lint","raw_affiliation_strings":["Bell Telephone Laboratories, Inc., Murray Hill, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Telephone Laboratories, Inc., Murray Hill, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5110264743"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5875,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.89419828,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":"6","first_page":"825","last_page":"826"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9739999771118164,"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.9739999771118164,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9686999917030334,"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/T12029","display_name":"DNA and Biological Computing","score":0.9642000198364258,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5820048451423645},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5202273726463318},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5202032923698425},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.5121133327484131},{"id":"https://openalex.org/keywords/polynomial-code","display_name":"Polynomial code","score":0.49475282430648804},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.46698588132858276},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.44738060235977173},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.43173301219940186},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39290791749954224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33971983194351196},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.30943113565444946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3054771423339844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.29838377237319946},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22596994042396545},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.20503631234169006}],"concepts":[{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5820048451423645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5202273726463318},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5202032923698425},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.5121133327484131},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.49475282430648804},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.46698588132858276},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.44738060235977173},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.43173301219940186},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39290791749954224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33971983194351196},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.30943113565444946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3054771423339844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29838377237319946},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22596994042396545},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.20503631234169006},{"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":3,"locations":[{"id":"doi:10.1109/tit.1972.1054904","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1972.1054904","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"},{"id":"pmh:oai:pure.tue.nl:openaire/13e82911-3267-40f6-9d87-d2926f451ca5","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/13e82911-3267-40f6-9d87-d2926f451ca5","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van Lint, J H 1972, 'A new description of the Nadler code', IEEE Transactions on Information Theory, vol. 18, no. 6, pp. 825-826. https://doi.org/10.1109/TIT.1972.1054904","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/13e82911-3267-40f6-9d87-d2926f451ca5","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/13e82911-3267-40f6-9d87-d2926f451ca5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Information Theory, 18(6), 825 - 826. Institute of Electrical and Electronics Engineers","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/13e82911-3267-40f6-9d87-d2926f451ca5","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/13e82911-3267-40f6-9d87-d2926f451ca5","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van Lint, J H 1972, 'A new description of the Nadler code', IEEE Transactions on Information Theory, vol. 18, no. 6, pp. 825-826. https://doi.org/10.1109/TIT.1972.1054904","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2010633994","https://openalex.org/W2062582191","https://openalex.org/W2109937605","https://openalex.org/W2112069403"],"related_works":["https://openalex.org/W4250402636","https://openalex.org/W1631960500","https://openalex.org/W2082705204","https://openalex.org/W2975172758","https://openalex.org/W4212825216","https://openalex.org/W2887855805","https://openalex.org/W1995463680","https://openalex.org/W2354277530","https://openalex.org/W2104558348","https://openalex.org/W1996227932"],"abstract_inverted_index":{"A":[0],"binary":[1],"code":[2,23],"of":[3,21,35],"length":[4],"12":[5],"and":[6],"minimum":[7],"distance":[8],"5":[9],"with":[10],"32":[11],"words":[12],"was":[13],"discovered":[14],"by":[15],"Nadler":[16],"in":[17],"1961.":[18],"Systematic":[19],"descriptions":[20],"this":[22],"given":[24],"later":[25],"use":[26],"larger":[27],"codes.":[28],"This":[29],"correspondence":[30],"gives":[31],"a":[32],"direct":[33],"construction":[34],"Nadler's":[36],"code.":[37]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}