请输入您要查询的百科知识:

 

词条 Alternant code
释义

  1. Definition

  2. Properties

  3. References

In coding theory, alternant codes form a class of parameterised error-correcting codes which generalise the BCH codes.

Definition

An alternant code over GF(q) of length n is defined by a parity check matrix H of alternant form Hi,j = αjiyi, where the αj are distinct elements of the extension GF(qm), the yi are further non-zero parameters again in the extension GF(qm) and the indices range as i from 0 to δ − 1, j from 1 to n.

Properties

The parameters of this alternant code are length n, dimension ≥ n − mδ and minimum distance ≥ δ + 1.

There exist long alternant codes which meet the Gilbert-Varshamov bound.

The class of alternant codes includes

  • BCH codes
  • Goppa codes
  • Srivastava codes

References

  • {{cite book | author=F.J. MacWilliams | authorlink=Jessie MacWilliams |author2=N.J.A. Sloane | title=The Theory of Error-Correcting Codes | publisher=North-Holland | date=1977 | isbn=0-444-85193-3 | pages=332–338 }}
{{crypto-stub}}

3 : Error detection and correction|Finite fields|Coding theory

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/9/28 1:18:22