List Decoding Tensor Products and Interleaved Codes

DOI10.1137/090778274zbMath1235.94073arXiv0811.4395OpenAlexW2015848652MaRDI QIDQ3115873

Prasad Raghavendra, Parikshit Gopalan, Venkatesan Guruswami

Publication date: 11 February 2012

Published in: SIAM Journal on Computing, Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.4395

zbMATH Keywords

tensor productsJohnson boundgeneralized Hamming weightserror-correcting codeslinear transformationslist decodinginterleaved codestensor product codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Decoding (94B35)

Related Items (5)

Higher Hamming weights for locally recoverable codes on algebraic curves ⋮ List-decoding Barnes-Wall lattices ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ A combination of testability and decodability by tensor products ⋮ Decoding of repeated-root cyclic codes up to new bounds on their minimum distance

This page was built for publication: List Decoding Tensor Products and Interleaved Codes