Lower bounds on t(n, k) from linear inequalities
From MaRDI portal
Publication:3991413
DOI10.1109/18.108272zbMath0746.94022OpenAlexW2138959817MaRDI QIDQ3991413
Publication date: 28 June 1992
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.108272
covering radiuscovering codeslower boundslinear inequalitybinary linear codeminimum distancedual codeHamming association scheme
This page was built for publication: Lower bounds on t(n, k) from linear inequalities