{"id":"https://openalex.org/W2116395689","doi":"https://doi.org/10.1109/isit.2011.6033681","title":"Solving the key equation for Hermitian codes with a division algorithm","display_name":"Solving the key equation for Hermitian codes with a division algorithm","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2116395689","doi":"https://doi.org/10.1109/isit.2011.6033681","mag":"2116395689"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2011.6033681","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","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/A5007506114","display_name":"Sabine Kampf","orcid":null},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sabine Kampf","raw_affiliation_strings":["Institute of Telecommunications and Applied Information Theory, University of Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications and Applied Information Theory, University of Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045353828","display_name":"Martin Bossert","orcid":"https://orcid.org/0000-0002-3827-9065"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Bossert","raw_affiliation_strings":["Institute of Telecommunications and Applied Information Theory, University of Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications and Applied Information Theory, University of Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042354687","display_name":"Irene I. Bouw","orcid":"https://orcid.org/0000-0002-8234-6966"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Irene I. Bouw","raw_affiliation_strings":["Institute of Pure Mathematics, University of Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Pure Mathematics, University of Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007506114"],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":null,"apc_paid":null,"fwci":2.2088,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.89487536,"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":"1008","last_page":"1012"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9979000091552734,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hermitian-matrix","display_name":"Hermitian matrix","score":0.8356354236602783},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6950803995132446},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.6630581617355347},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6183459162712097},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5879907011985779},{"id":"https://openalex.org/keywords/division","display_name":"Division (mathematics)","score":0.5818551778793335},{"id":"https://openalex.org/keywords/bivariate-analysis","display_name":"Bivariate analysis","score":0.5314841270446777},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.461757630109787},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4606504440307617},{"id":"https://openalex.org/keywords/euclidean-algorithm","display_name":"Euclidean algorithm","score":0.4528267979621887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4307512640953064},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.42720210552215576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.421282559633255},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.415335088968277},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4148717522621155},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3896045982837677},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.30536872148513794},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.24548986554145813},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.14338156580924988},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1234498918056488},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10232105851173401},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09039881825447083}],"concepts":[{"id":"https://openalex.org/C94940","wikidata":"https://www.wikidata.org/wiki/Q652941","display_name":"Hermitian matrix","level":2,"score":0.8356354236602783},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6950803995132446},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.6630581617355347},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6183459162712097},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5879907011985779},{"id":"https://openalex.org/C60798267","wikidata":"https://www.wikidata.org/wiki/Q1226939","display_name":"Division (mathematics)","level":2,"score":0.5818551778793335},{"id":"https://openalex.org/C64341305","wikidata":"https://www.wikidata.org/wiki/Q4919225","display_name":"Bivariate analysis","level":2,"score":0.5314841270446777},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.461757630109787},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4606504440307617},{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.4528267979621887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4307512640953064},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.42720210552215576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.421282559633255},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.415335088968277},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4148717522621155},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3896045982837677},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.30536872148513794},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.24548986554145813},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.14338156580924988},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1234498918056488},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10232105851173401},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09039881825447083},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/isit.2011.6033681","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","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":9,"referenced_works":["https://openalex.org/W1518341038","https://openalex.org/W1557415002","https://openalex.org/W1983801350","https://openalex.org/W2034321633","https://openalex.org/W2045528863","https://openalex.org/W2098958316","https://openalex.org/W2104379151","https://openalex.org/W2145830640","https://openalex.org/W2165471216"],"related_works":["https://openalex.org/W2108723338","https://openalex.org/W2387018018","https://openalex.org/W2100507996","https://openalex.org/W2182725540","https://openalex.org/W1586790543","https://openalex.org/W2010604914","https://openalex.org/W2166268357","https://openalex.org/W2050784748","https://openalex.org/W2127184884","https://openalex.org/W4286545247"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,34,51],"division":[4],"algorithm":[5,32,40],"to":[6,25,37,59,85],"solve":[7],"the":[8,27,38,43,67,77,87],"key":[9],"equation":[10],"for":[11,66],"Hermitian":[12,71],"codes,":[13,47],"which":[14],"is":[15,50],"capable":[16],"of":[17,45,69,73],"locating":[18],"most":[19],"error":[20],"patterns":[21],"with":[22],"weight":[23],"up":[24],"half":[26],"designed":[28],"minimum":[29],"distance.":[30],"The":[31],"has":[33],"structure":[35],"similar":[36],"Euclidean":[39],"used":[41],"in":[42],"decoding":[44,68],"Reed-Solomon":[46],"yet":[48],"it":[49],"little":[52],"more":[53],"complex":[54],"because":[55],"bivariate":[56],"polynomials":[57],"have":[58],"be":[60],"used.":[61],"We":[62],"give":[63],"simulation":[64],"results":[65],"several":[70],"codes":[72],"various":[74],"rates":[75],"over":[76],"finite":[78],"field":[79],"GF(2":[80],"<sup":[81],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[82],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">4</sup>":[83],")":[84],"verify":[86],"claims.":[88]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-02T06:13:33.250793","created_date":"2025-10-10T00:00:00"}