{"id":"https://openalex.org/W6884681868","doi":"https://doi.org/10.11575/cdm.v1i1.61901","title":"Classification of linear codes exploiting an invariant","display_name":"Classification of linear codes exploiting an invariant","publication_year":2005,"publication_date":"2005-04-06","ids":{"openalex":"https://openalex.org/W6884681868","doi":"https://doi.org/10.11575/cdm.v1i1.61901"},"language":"en","primary_location":{"id":"doi:10.11575/cdm.v1i1.61901","is_oa":true,"landing_page_url":"https://doi.org/10.11575/cdm.v1i1.61901","pdf_url":null,"source":{"id":"https://openalex.org/S7407053067","display_name":"University of Calgary","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.11575/cdm.v1i1.61901","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Marcugini, Stefano","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marcugini, Stefano","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Milani, Alfredo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Milani, Alfredo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Pambianco, Fernanda","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pambianco, Fernanda","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.48659899,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.5008999705314636,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.5008999705314636,"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/T11130","display_name":"Coding theory and cryptography","score":0.27469998598098755,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.016300000250339508,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.5403000116348267},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.474700003862381},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4546000063419342},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45320001244544983},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.40130001306533813},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.3409000039100647}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5960000157356262},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.5403000116348267},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.474700003862381},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4546000063419342},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45320001244544983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4422999918460846},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4163999855518341},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.40130001306533813},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3953999876976013},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3391999900341034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3158000111579895},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.26750001311302185},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25459998846054077}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.11575/cdm.v1i1.61901","is_oa":true,"landing_page_url":"https://doi.org/10.11575/cdm.v1i1.61901","pdf_url":null,"source":{"id":"https://openalex.org/S7407053067","display_name":"University of Calgary","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.11575/cdm.v1i1.61901","is_oa":true,"landing_page_url":"https://doi.org/10.11575/cdm.v1i1.61901","pdf_url":null,"source":{"id":"https://openalex.org/S7407053067","display_name":"University of Calgary","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,28],"consider":[1],"the":[2,6,42,46,52,54,57,69,84,87],"problem":[3,16,71,85],"of":[4,9,12,25,45,86,89],"computing":[5],"equivalence":[7],"classes":[8],"a":[10,30],"set":[11],"linear":[13],"codes.":[14],"This":[15],"arises":[17],"when":[18],"new":[19],"codes":[20,24,59,74],"are":[21],"obtained":[22],"extending":[23],"lower":[26],"dimension.":[27],"propose":[29],"technique":[31,51,79],"that,":[32],"exploiting":[33],"an":[34],"invariant":[35],"simple":[36],"to":[37,40,67,83],"compute,":[38],"allows":[39],"reduce":[41],"computational":[43],"complexity":[44],"classification":[47,88],"process.":[48],"Using":[49],"this":[50],"[13,5,8]_7,":[53],"[14,5,9]_8":[55],"and":[56],"[15,4,11]_9":[58],"have":[60],"been":[61],"classified.":[62],"These":[63],"classifications":[64],"enabled":[65],"us":[66],"solve":[68],"packing":[70],"for":[72,75],"NMDS":[73],"q=7,8,9.":[76],"The":[77],"same":[78],"can":[80],"be":[81],"applied":[82],"other":[90],"structures.":[91]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}