Minimax nonredundant channel coding

DOI10.1109/26.380112zbMath1159.94352OpenAlexW2155531989MaRDI QIDQ2726515

Lee C. Potter, Da-Ming Chiang

Publication date: 18 July 2001

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Related Items (2)

Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry ⋮ A new relaxation framework for quadratic assignment problems based on matrix splitting

This page was built for publication: Minimax nonredundant channel coding