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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94B15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94B65 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6637553 / rank
 
Normal rank
Property / zbMATH Keywords
 
cyclic codes
Property / zbMATH Keywords: cyclic codes / rank
 
Normal rank
Property / zbMATH Keywords
 
BCH bound
Property / zbMATH Keywords: BCH bound / rank
 
Normal rank
Property / zbMATH Keywords
 
apparent distance
Property / zbMATH Keywords: apparent distance / rank
 
Normal rank
Property / zbMATH Keywords
 
BCH codes
Property / zbMATH Keywords: BCH codes / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum distance
Property / zbMATH Keywords: minimum distance / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAP / 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.3934/amc.2016018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2346418928 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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