On the optimum distance profiles of some quasi cyclic codes
| Autor: | Yuan Luo, Jinzhou Yan, Zhuojun Zhuang |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
Block code
Prefix code Theoretical computer science Polynomial code Computer science Code division multiple access Concatenated error correction code Variable-length code Reed–Muller code Coding theory Linear code Expander code Reed–Solomon error correction Cyclic code Fountain code Turbo code Binary code Forward error correction Constant-weight code Low-density parity-check code Hamming code Algorithm Raptor code Communication channel |
| Zdroj: | 2011 IEEE 13th International Conference on Communication Technology. |
| DOI: | 10.1109/icct.2011.6158025 |
| Popis: | In practical wireless communication systems, optimum distance profile (ODP) is useful in the coding schemes, such as the coding of the transport format combination indicator (TFCI) in WCDMA and the channel quality indicator (CQI) in LTE. For an arbitrary binary linear code, it is hard to compute the ODP by hand. In this paper, an algorithm for determining the ODP of a given code is proposed. For example, the ODPs of some quasi cyclic codes are found and proved, and the quasi cyclic code can be fast encoded with simple shift registers. Another application of the proposed algorithm for searching codes is shown at the end of this paper. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|