A new upper bound on nonbinary block codes

Discrete Mathematics

Volumn 83, Issue 2-3, 1990, Pages 139-160

  Aaltonen, Matti ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249016502     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(90)90002-Y     Document Type: Article

References (24)

1. Linear programming bounds for tree codes (Corresp.)
2. Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance
3. Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
4. Orthogonal polynomials and special functions
5. An algebraic approach to the association schemes theory
6. A Comparison of Signalling Alphabets
7. Error Detecting and Error Correcting Codes
8. On the minimal redundancy of binary error-correcting codes (in Russian)
9. Problemy Peredachi Informatsii
10. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
11. Binary codes with specified minimum distance
12. Upper bounds for the number of points of a binary code with a specified code distance
13. Problemy Peredachi Informatsii
14. Maximum distance<tex>q</tex>-nary codes
15. An approach to constant weight and Lee codes by using the methods of association schemes
16. On the Nonbinary Johnson Scheme
17. Uniformly packed codes
18. On Goppa codes which are better than the Varshamov-Gilbert bound (in Russian)
19. Problemy Peredachi Informatsii
20. Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound