Cyclic and BCH codes whose minimum distance equals their maximum BCH bound (Q326325): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4121811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic generalization of BCH-Goppa-Helgert codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Error-Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum distance of cyclic codes / rank
 
Normal rank

Latest revision as of 17:48, 12 July 2024

scientific article
Language Label Description Also known as
English
Cyclic and BCH codes whose minimum distance equals their maximum BCH bound
scientific article

    Statements

    Cyclic and BCH codes whose minimum distance equals their maximum BCH bound (English)
    0 references
    0 references
    12 October 2016
    0 references
    0 references
    cyclic codes
    0 references
    BCH bound
    0 references
    apparent distance
    0 references
    BCH codes
    0 references
    minimum distance
    0 references
    0 references