A new upper bound on the rate of non-binary codes
From MaRDI portal
Publication:874418
Recommendations
- scientific article; zbMATH DE number 4047601
- A new upper bound on nonbinary block codes
- scientific article; zbMATH DE number 3410920
- Publication:3496286
- Upper and lower bounds for continuous non-malleable codes
- A new upper bound for single error-correcting codes
- An Improvement of the Asymptotic Elias Bound for Non-Binary Codes
- A new class of nonbinary codes meeting the Griesmer bound
- Upper bounds on the rate of LDPC codes
- scientific article; zbMATH DE number 969276
Cited in
(14)- New lower bounds on aperiodic crosscorrelation of binary codes
- Code bounds for multiple packings over a nonbinary finite alphabet
- Rate one-third non-malleable codes
- Capacity of non-malleable codes
- A new upper bound on nonbinary block codes
- Bounds on the rate of disjunctive codes
- scientific article; zbMATH DE number 4170841 (Why is no real title available?)
- scientific article; zbMATH DE number 3952664 (Why is no real title available?)
- Upper bounds on the rate of LDPC codes
- Dense packings from quadratic fields and codes
- Upper bounds and Hamming spheres under the DC constraint
- New nonbinary code bounds based on divisibility arguments
- scientific article; zbMATH DE number 4047601 (Why is no real title available?)
- New Bounds and Constructions for Granular Media Coding
This page was built for publication: A new upper bound on the rate of non-binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874418)
