A method for efficiently computing the number of codewords of fixed weights in linear codes (Q1005242): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GUAVA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018124973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3511531 / 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: Some new extremal self-dual codes with lengths 44, 50, 54, and 58 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal quaternary linear codes of dimension five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal linear codes of dimension 4 over F/sub 5/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal self-dual codes with an automorphism of order 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(q\)-ary Gray codes and weight distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic algorithm for computing minimum weights of large error-correcting 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 03:46, 29 June 2024

scientific article
Language Label Description Also known as
English
A method for efficiently computing the number of codewords of fixed weights in linear codes
scientific article

    Statements

    A method for efficiently computing the number of codewords of fixed weights in linear codes (English)
    0 references
    9 March 2009
    0 references
    linear code
    0 references
    codewords generating
    0 references
    weight spectrum algorithm
    0 references
    minimum distance algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers