A new upper bound on nonbinary block codes
From MaRDI portal
Publication:920930
DOI10.1016/0012-365X(90)90002-YzbMath0708.94020MaRDI QIDQ920930
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
linear programmingternary codesasymptotic boundElias boundinformation rate of nonbinary block codesnon-binary Johnson scheme
Related Items (5)
Unnamed Item ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ Dense packings from quadratic fields and codes ⋮ Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes ⋮ On bounds for codes over Frobenius rings under homogeneous weights
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Goppa codes that are better than the Varshamov-Gilbert bound
- On the nonbinary Johnson scheme
- Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Upper bounds on the cardinality of a binary code with a given minimum distance
- On the minimal redundancy of binary error-correcting codes
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Linear programming bounds for tree codes (Corresp.)
- Error Detecting and Error Correcting Codes
- Maximum distance<tex>q</tex>-nary codes
This page was built for publication: A new upper bound on nonbinary block codes
