On character sums and codes
- 1 December 1985
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 57 (3) , 285-295
- https://doi.org/10.1016/0012-365x(85)90180-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Lower Bounds for the Maximum Moduli of Certain Character SumsJournal of the London Mathematical Society, 1984
- Notes on the asymptotic behavior of the information rate of block codes (Corresp.)IEEE Transactions on Information Theory, 1984
- Linear programming bounds for tree codes (Corresp.)IEEE Transactions on Information Theory, 1979
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- The MacWilliams Identities for Nonlinear CodesBell System Technical Journal, 1972