{"id":"https://openalex.org/W1994397096","doi":"https://doi.org/10.1109/isit.2005.1523715","title":"New codes from chains of quasi-cyclic codes","display_name":"New codes from chains of quasi-cyclic codes","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1994397096","doi":"https://doi.org/10.1109/isit.2005.1523715","mag":"1994397096"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523715","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-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/A5036635049","display_name":"Markus Grassl","orcid":"https://orcid.org/0000-0002-3720-5195"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"M. Grassl","raw_affiliation_strings":["Institut f\u00fcr Algorithmen und Kognitive Systeme, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Algorithmen und Kognitive Systeme, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071517177","display_name":"G. White","orcid":null},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"G. White","raw_affiliation_strings":["Computational Algebra Group, School of Mathematics and Statistics F07, University of Sydney, Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"Computational Algebra Group, School of Mathematics and Statistics F07, University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036635049"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":1.3162,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.83725619,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2095","last_page":"2099"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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.9998999834060669,"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/T10849","display_name":"Finite Group Theory Research","score":0.9929999709129333,"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"}},{"id":"https://openalex.org/T13779","display_name":"Cancer Mechanisms and Therapy","score":0.9764000177383423,"subfield":{"id":"https://openalex.org/subfields/2734","display_name":"Pathology and Forensic Medicine"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5805429220199585},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.48619455099105835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46729472279548645},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.4672061800956726},{"id":"https://openalex.org/keywords/chain","display_name":"Chain (unit)","score":0.43156105279922485},{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.4306301474571228},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.42526301741600037},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.42277994751930237},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.41998618841171265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3931579291820526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.340337872505188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33968496322631836},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.16092747449874878},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07708072662353516}],"concepts":[{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5805429220199585},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.48619455099105835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46729472279548645},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.4672061800956726},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.43156105279922485},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.4306301474571228},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.42526301741600037},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.42277994751930237},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.41998618841171265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3931579291820526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.340337872505188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33968496322631836},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.16092747449874878},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07708072662353516},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523715","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W58239232","https://openalex.org/W125120570","https://openalex.org/W1606480398","https://openalex.org/W1973817791","https://openalex.org/W1976677460","https://openalex.org/W1993251121","https://openalex.org/W1993602218","https://openalex.org/W2097701940","https://openalex.org/W2115789360","https://openalex.org/W2129185510","https://openalex.org/W6602325378","https://openalex.org/W6605076875","https://openalex.org/W6991833055"],"related_works":["https://openalex.org/W2037763716","https://openalex.org/W2150212378","https://openalex.org/W1976052006","https://openalex.org/W1798117689","https://openalex.org/W1968396483","https://openalex.org/W4297536019","https://openalex.org/W2131310741","https://openalex.org/W2913933112","https://openalex.org/W2950636389","https://openalex.org/W4248511311"],"abstract_inverted_index":{"Well":[0],"known":[1,20],"constructions":[2,55],"are":[3],"applied":[4,32],"to":[5,12,33],"chains":[6,34],"of":[7,35,51],"quasi-cyclic":[8,52],"codes":[9,15,62],"in":[10],"order":[11],"achieve":[13],"new":[14,61],"that":[16],"improve":[17],"on":[18,22],"best":[19],"bounds":[21,66],"the":[23,48,54,64],"minimum":[24,49],"distance.":[25],"These":[26],"techniques":[27],"have":[28,56],"previously":[29],"been":[30],"successfully":[31],"cyclic":[36],"and":[37],"algebraic-geometric":[38],"codes.":[39],"In":[40],"conjunction":[41],"with":[42],"an":[43],"improved":[44],"algorithm":[45],"for":[46],"computing":[47],"weight":[50],"codes,":[53],"so":[57],"far":[58],"yielded":[59],"274":[60],"improving":[63],"lower":[65]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}