Trade-offs in bit-rate allocation for wireless video streaming
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Fingerprinting with minimum distance decoding
IEEE Transactions on Information Forensics and Security
Trade-offs in bit-rate allocation for wireless video streaming
IEEE Transactions on Multimedia - Special issue on quality-driven cross-layer design for multimedia communications
Relations between random coding exponents and the statistical physics of random codes
IEEE Transactions on Information Theory
The capacity of finite Abelian group codes over symmetric memoryless channels
IEEE Transactions on Information Theory
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Spectra and minimum distances of repeat multiple-accumulate codes
IEEE Transactions on Information Theory
Channel coding rate in the finite blocklength regime
IEEE Transactions on Information Theory
On correctable errors of binary linear codes
IEEE Transactions on Information Theory
Achieving the rate-distortion bound with low-density generator matrix codes
IEEE Transactions on Communications
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
IEEE Transactions on Information Theory
Memoryless near-collisions via coding theory
Designs, Codes and Cryptography
An efficient attack on all concrete KKS proposals
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
A computability challenge: asymptotic bounds for error-correcting codes
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Asymptotic behaviour of codes in rank metric over finite fields
Designs, Codes and Cryptography
| Hi-index | 755.20 |
Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes from Shannon's random code ensemble and for typical codes from a random linear code ensemble. A typical random code of length N and rate R is shown to have minimum distance NδGV(2R), where δGV(R) is the Gilbert-Varshamov (GV) relative distance at rate R, whereas a typical linear code (TLC) has minimum distance NδGV(R). Consequently, a TLC has a better error exponent on a BSC at low rates, namely, the expurgated error exponent.