Some results related to generalized Varshamov-Gilbert bounds (Corresp.)
- 1 July 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 23 (4) , 517-518
- https://doi.org/10.1109/tit.1977.1055736
Abstract
Two generalizations of the Varshamov-Gilbert bound for error-correcting and error-detecting codes are developed. Sufficient intrinsic conditions are given for classes of linear codes over GF(q)to include "good" codes, and these classes are related to other known classes. A lower bound on the maximal order of subspaces contained in subsets of certain finite vector spaces is given and related to a bound on error-detecting codes.Keywords
This publication has 3 references indexed in Scilit:
- Goppa codesIEEE Transactions on Information Theory, 1973
- Good self dual codes existDiscrete Mathematics, 1972
- Class of constructive asymptotically good algebraic codesIEEE Transactions on Information Theory, 1972