A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code (Q2863727): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Antonio Aparecido de Andrade / rank
Normal rank
 
Property / author
 
Property / author: Antonio Aparecido de Andrade / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3589495 / 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: Generators and weights of polynomial codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divisibility properties in semigroup rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing parameters of graph-based extensions of BCH codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5506328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encoding through generalized polynomial codes / rank
 
Normal rank

Latest revision as of 02:46, 7 July 2024

scientific article
Language Label Description Also known as
English
A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
scientific article

    Statements

    Identifiers