Efficient representation of binary nonlinear codes: constructions and minimum distance computation (Q2350921): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071383517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic techniques for nonlinear 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: \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality / 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: A method for efficiently computing the number of codewords of fixed weights in linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for linear codes with large minimum distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfect \(p\)-ary codes of length \(p+1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Error-Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two new four-error-correcting binary codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank

Latest revision as of 09:48, 10 July 2024

scientific article
Language Label Description Also known as
English
Efficient representation of binary nonlinear codes: constructions and minimum distance computation
scientific article

    Statements

    Efficient representation of binary nonlinear codes: constructions and minimum distance computation (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    nonlinear code
    0 references
    kernel
    0 references
    minimum distance
    0 references
    minimum weight
    0 references
    decoding
    0 references
    algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references