{"id":"https://openalex.org/W2247110676","doi":"https://doi.org/10.1007/s10623-018-0506-1","title":"On non-full-rank perfect codes over finite fields","display_name":"On non-full-rank perfect codes over finite fields","publication_year":2018,"publication_date":"2018-06-07","ids":{"openalex":"https://openalex.org/W2247110676","doi":"https://doi.org/10.1007/s10623-018-0506-1","mag":"2247110676"},"language":"en","primary_location":{"id":"doi:10.1007/s10623-018-0506-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10623-018-0506-1","pdf_url":null,"source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","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/A5072340410","display_name":"Alexander M. Romanov","orcid":"https://orcid.org/0000-0003-1591-1096"},"institutions":[{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexander M. Romanov","raw_affiliation_strings":["Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, Novosibirsk, Russia, 630090"],"affiliations":[{"raw_affiliation_string":"Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, Novosibirsk, Russia, 630090","institution_ids":["https://openalex.org/I4210096862"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072340410"],"corresponding_institution_ids":["https://openalex.org/I4210096862"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3375,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.66300058,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"87","issue":"5","first_page":"995","last_page":"1003"},"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/T11797","display_name":"graph theory and CDMA systems","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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.7599952816963196},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.6928551197052002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6481125354766846},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6078507304191589},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5475314259529114},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5455651879310608},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5427345037460327},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5298592448234558},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5138214230537415},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4891362488269806},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.461384117603302},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.45736557245254517},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.44781023263931274},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.41874751448631287},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4094071090221405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20332196354866028},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16899913549423218},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.0865115225315094}],"concepts":[{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.7599952816963196},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.6928551197052002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6481125354766846},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6078507304191589},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5475314259529114},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5455651879310608},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5427345037460327},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5298592448234558},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5138214230537415},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4891362488269806},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.461384117603302},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.45736557245254517},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.44781023263931274},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.41874751448631287},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4094071090221405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20332196354866028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16899913549423218},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0865115225315094},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10623-018-0506-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10623-018-0506-1","pdf_url":null,"source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","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":25,"referenced_works":["https://openalex.org/W1525308658","https://openalex.org/W1538771370","https://openalex.org/W1553529714","https://openalex.org/W1606480398","https://openalex.org/W1875081033","https://openalex.org/W1964584687","https://openalex.org/W1966494597","https://openalex.org/W1977128710","https://openalex.org/W2019915930","https://openalex.org/W2028612572","https://openalex.org/W2042453267","https://openalex.org/W2054563306","https://openalex.org/W2056147184","https://openalex.org/W2116611140","https://openalex.org/W2120479184","https://openalex.org/W2144005619","https://openalex.org/W2155439537","https://openalex.org/W2160658340","https://openalex.org/W2166966427","https://openalex.org/W2530671821","https://openalex.org/W2753264944","https://openalex.org/W2884931858","https://openalex.org/W2949690177","https://openalex.org/W3102043055","https://openalex.org/W3102143583"],"related_works":["https://openalex.org/W2110798623","https://openalex.org/W2762830775","https://openalex.org/W4388321894","https://openalex.org/W43044209","https://openalex.org/W2348746730","https://openalex.org/W2964136540","https://openalex.org/W2142157400","https://openalex.org/W4246247137","https://openalex.org/W2363317838","https://openalex.org/W2463698110"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
