Scholarlink

BCH codes are presented as sub-field sub-codes of Reed-Solomon (RS) codes. Conjugacy constraints determine relations in DFT domain similar to the ones known from signal processing to ensure a real time domain signal. Examples are primitive BCH codes and the Golay code. The encoding methods discussed earlier are specialized for binary BCH codes.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Bose-Chaudhuri-Hocqhenghem (BCH) Codes, Especially Binary BCH Codes

  • 章节

  • 发表日期：

    2026年

查看全文
  • Werner Henkel

摘要

BCH codes are presented as sub-field sub-codes of Reed-Solomon (RS) codes. Conjugacy constraints determine relations in DFT domain similar to the ones known from signal processing to ensure a real time domain signal. Examples are primitive BCH codes and the Golay code. The encoding methods discussed earlier are specialized for binary BCH codes.