Generalizations of the BCH bound
From MaRDI portal
Publication:5652536
DOI10.1016/S0019-9958(72)90887-XzbMath0241.94013MaRDI QIDQ5652536
Kenneth K. Tzeng, Carlos R. P. Hartmann
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
Related Items
Sum-rank product codes and bounds on the minimum distance, Rank error-correcting pairs, A symmetric Roos bound for linear codes, Another generalisation of the binary Reed-Muller codes and its applications, Some properties of skew codes over finite fields, Algebraic theory of block codes detecting independent errors, Four infinite families of ternary cyclic codes with a square-root-like lower bound, Coding and bounds for partially defective memory cells, Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes, Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance, BCH cyclic codes, Cyclic codes from cyclotomic sequences of order four, A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes, A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound, On some bounds on the minimum distance of cyclic codes over finite fields, Roos bound for skew cyclic codes in Hamming and rank metric, On the roots and minimum rank distance of skew cyclic codes, New bounds on the minimum distance of cyclic codes, A note on cyclic codes from APN functions, On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1}, A survey of constructive coding theory, and a table of binary codes of highest known rate, Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\), Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
