Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
From MaRDI portal
Publication:3548016
DOI10.1109/TIT.2006.880050zbMath1320.94093arXivcs/0506087WikidataQ57735122 ScholiaQ57735122MaRDI QIDQ3548016
Kaoru Kurosawa, Tomohiko Uyematsu, Ryutaroh Matsumoto, Toshimitsu Konno, Toshiya Itoh
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0506087
Related Items
Оценки объемов окрестностей двоичных кодов в терминах их весовых спектров, A simple combinatorial treatment of constructions and threshold gaps of ramp schemes, On the Hamming distance in combinatorial optimization problems on hypergraph matchings, Boolean functions: degree and support, Vectorial resilient \(\mathrm{PC}(l)\) of order \(k\) Boolean functions from AG-codes