A new upper bound on the rate of non-binary codes
From MaRDI portal
Publication:874418
DOI10.3934/AMC.2007.1.83zbMATH Open1198.94199OpenAlexW2175843853MaRDI QIDQ874418FDOQ874418
Publication date: 5 April 2007
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2007.1.83
Association schemes, strongly regular graphs (05E30) Combinatorial codes (94B25) Bounds on codes (94B65)
Cited In (9)
- A new upper bound on nonbinary block codes
- Capacity of non-malleable codes
- Rate one-third non-malleable codes
- Upper bounds on the rate of LDPC codes
- New lower bounds on aperiodic crosscorrelation of binary codes
- Upper bounds and Hamming spheres under the DC constraint
- Bounds on the rate of disjunctive codes
- Dense packings from quadratic fields and codes
- New Bounds and Constructions for Granular Media Coding
Recommendations
- Title not available (Why is that?) 👍 👎
- A new upper bound on nonbinary block codes 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
- Title not available (Why is that?) 👍 👎
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)
