Computing an Invariant of a Linear Code (Q5014679): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the permutation between equivalent linear codes: the support splitting algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is code equivalence easy to decide? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4674258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing automorphism groups of error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-Correction Capability of Binary Linear Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Characterization of Border Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak order ideal associated to linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Gröbner bases structure associated to linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing coset leaders and leader codewords of binary codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-correcting linear codes. Classification by isometry and applications. With CD-ROM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365126 / rank
 
Normal rank

Latest revision as of 10:31, 27 July 2024

scientific article; zbMATH DE number 7441071
Language Label Description Also known as
English
Computing an Invariant of a Linear Code
scientific article; zbMATH DE number 7441071

    Statements

    Identifiers