An Algorithm for Augmenting a Binary Linear Code up to Gilbert Bound and New Codes Obtained by the Algorithm(Special Section on Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
An algorithm for augmenting a binary linear code is presented. The input to the code augmenting algorithm is (n,k,d) code C and the output is an (n,k^*,d) augmented code C'(k^*≥k) satisfying C ⊂ C' and the Gilbert bound. The algorithm can be considered as an efficient implementation of the proof of Gilbert bound; for a given binary linear code C, the algorithm first finds a coset leader with the largest weight. If the weight of the coset leader is greater than or equal to the minimum distance of C, the coset leader is included to the basis of C'.
- 社団法人電子情報通信学会の論文
- 2002-10-01
著者
-
Wadayama Tadashi
Faculty Of Computer Science And System Engineering Okayama Prefectural University
-
HADOKAWA Hiroyuki
Faculty of Computer Science and System Engineering, Okayama Prefectural University
-
Hadokawa Hiroyuki
Faculty Of Computer Science And System Engineering Okayama Prefectural University
関連論文
- An Upper Bound on Frame Error Rate for Generalized Concatenated Convolutional Codes
- A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel (Special Section on Information Theory and Its Applications)
- A Class of Trellis-Codes for Partial Response Channel
- High Rate Binary Coset Code Used for Inner Code
- Multi-Dimensional Block Shaping
- Methods for Calculating Exact Bit Error Probability of a Binary Linear Code over Binary Symmetric Channel
- An Iterative Decoding Algorithm for Channels with Additive Linear Dynamical Noise
- An Algorithm for Augmenting a Binary Linear Code up to Gilbert Bound and New Codes Obtained by the Algorithm(Special Section on Information Theory and Its Applications)