New Bounds and Constructions for Granular Media Coding

DOI10.1109/TIT.2015.2445758MaRDI QIDQ2977328zbMATH OpenFDO

Authors Artyom Sharov, Ron M. Roth

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2015.2445758

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Bounds and Constructions for Granular Media Coding
• Upper Bounds on the Size of Grain-Correcting Codes
• New constructions of codes meeting the Griesmer bound
• New bounds on \(D\)-ary optimal codes
• New Nonasymptotic Channel Coding Theorems for Structured Codes
• Grassmannian Codes With New Distance Measures for Network Coding
• New Bounds on Separable Codes for Multimedia Fingerprinting
• scientific article; zbMATH DE number 1803256
• A new upper bound on the rate of non-binary codes
• Random-coding bounds for some broadcast channels

This page was built for publication: New Bounds and Constructions for Granular Media Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977328)