Nonlinear Codes Outperform the Best Linear Codes on the Binary Erasure Channel
Metadata only
Date
2015Type
- Conference Paper
Publication status
publishedExternal links
Book title
IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015Pages / Article No.
Publisher
IEEEEvent
Subject
Binary erasure channel; Generalized Plotkin bound; Optimal nonlinear channel coding; r-wise Hamming distance; Weak flip codes.Organisational unit
03529 - Lapidoth, Amos / Lapidoth, Amos
More
Show all metadata