Input-Output Distance Properties of Good Linear Codes
Consider a linear code defined as a mapping between vector spaces of dimensions k and n. Let β* denote the minimal (relative) weight among all images of input vectors of full Hamming weight k. Operationally, β* characterizes the threshold for adversarial (erasure) noise beyond which decoder is guara...
Main Authors: | Hosseini Roozbehani, Hajir (Author), Polyanskiy, Yury (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2020-01-20T21:24:03Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Graceful degradation over the BEC via non-linear codes
by: Hosseini Roozbehani, Hajir, et al.
Published: (2021) -
Algebraic methods of classifying directed graphical models
by: Polyanskiy, Yury, et al.
Published: (2016) -
Broadcasting on trees near criticality
by: Gu, Yuzhou, et al.
Published: (2021) -
Broadcasting on trees near criticality
by: Gu, Yuzhou, et al.
Published: (2021) -
Relative entropy at the channel output of a capacity-achieving code
by: Polyanskiy, Yury, et al.
Published: (2013)