{"id":"https://openalex.org/W2086996596","doi":"https://doi.org/10.1109/isit.2005.1523731","title":"Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flipping","display_name":"Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flipping","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2086996596","doi":"https://doi.org/10.1109/isit.2005.1523731","mag":"2086996596"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523731","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523731","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":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/ed4be4ee-7885-43b1-bdc8-bc0c424e055c","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061203057","display_name":"Tom H\u00f8holdt","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"T. Hoholdt","raw_affiliation_strings":["Department of Mathematics, Technical University of Denmark, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113536808","display_name":"J. Justesen","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"J. Justesen","raw_affiliation_strings":["COM Technical University of Denmark, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"COM Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009514870","display_name":"Bengt J\u00f6nsson","orcid":"https://orcid.org/0000-0001-7897-601X"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"B. Jonsson","raw_affiliation_strings":["Department of Mathematics, Technical University of Denmark, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061203057"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.7786,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77398384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2171","last_page":"2173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"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.9969000220298767,"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/decoding-methods","display_name":"Decoding methods","score":0.7934750318527222},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6335552930831909},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.6043323278427124},{"id":"https://openalex.org/keywords/bit","display_name":"Bit (key)","score":0.5368004441261292},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4996821880340576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45600804686546326},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.431454598903656},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.41899868845939636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4184042513370514},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.4139425754547119},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.40258362889289856},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36211448907852173},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2340012788772583},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11544132232666016}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7934750318527222},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6335552930831909},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.6043323278427124},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.5368004441261292},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4996821880340576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45600804686546326},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.431454598903656},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.41899868845939636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4184042513370514},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.4139425754547119},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.40258362889289856},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36211448907852173},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2340012788772583},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11544132232666016},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2005.1523731","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523731","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"},{"id":"pmh:oai:pure.atira.dk:publications/ed4be4ee-7885-43b1-bdc8-bc0c424e055c","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/ed4be4ee-7885-43b1-bdc8-bc0c424e055c","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"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":"H\u00f8holdt , T , Justesen , J & Jonsson , B 2005 , Euclidean Geometry Codes, minimum weight words and decodable error-patterns using bit-flipping . in Proceedings of the 2005 IEEE International Symposium on Information Theory . IEEE , Adelaide, Australia , 2005 IEEE International Symposium on Information Theory , Adelaide , South Australia , Australia , 04/09/2005 . https://doi.org/10.1109/ISIT.2005.1523731","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/ed4be4ee-7885-43b1-bdc8-bc0c424e055c","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/ed4be4ee-7885-43b1-bdc8-bc0c424e055c","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"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":"H\u00f8holdt , T , Justesen , J & Jonsson , B 2005 , Euclidean Geometry Codes, minimum weight words and decodable error-patterns using bit-flipping . in Proceedings of the 2005 IEEE International Symposium on Information Theory . IEEE , Adelaide, Australia , 2005 IEEE International Symposium on Information Theory , Adelaide , South Australia , Australia , 04/09/2005 . https://doi.org/10.1109/ISIT.2005.1523731","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1589291987","https://openalex.org/W2114869758","https://openalex.org/W2124113125"],"related_works":["https://openalex.org/W2090152127","https://openalex.org/W1965169884","https://openalex.org/W3125580510","https://openalex.org/W2008939113","https://openalex.org/W14679004","https://openalex.org/W1566651525","https://openalex.org/W2977652649","https://openalex.org/W2318206461","https://openalex.org/W37157938","https://openalex.org/W4298154183"],"abstract_inverted_index":{"We":[0],"determine":[1],"the":[2,17,23,26],"number":[3],"of":[4,11,19,25],"minimum":[5],"weight":[6],"codewords":[7],"in":[8],"a":[9],"class":[10],"Euclidean":[12],"geometry":[13,24],"codes":[14],"and":[15],"link":[16],"performance":[18],"bit-flipping":[20],"decoding":[21],"to":[22],"error":[27],"patterns.":[28]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}