Results 201 to 210 of about 63,628 (226)
Some of the next articles are maybe not open access.
On singleton-type bound of locally repairable codes
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xing Lin, Han Cai, Xiaohu Tang
exaly +3 more sources
Entanglement-assisted quantum communication beating the quantum Singleton bound
Physical Review A, 2021 Brun, Devetak, and Hsieh [Science 314, 436 (2006)] demonstrated that preshared entanglement between the sender and receiver enables quantum communication protocols that have better parameters than schemes without the assistance of entanglement ...
Markus Grassl
exaly +2 more sources
Slight improvements of the Singleton bound
Discrete Mathematics, 2004 The problem of determining Aq(n,d), the maximum cardinality of a q-ary code of length n with minimum distance at least d, is considered in some cases where corresponding MDS codes do not exist.
Jorn Quistorff
exaly +2 more sources
List Decoding of Cover Metric Codes Up to the Singleton Bound
IEEE Transactions on Information Theory, 2018 Wachter-Zeh showed that every cover metric code can be list decoded up to the Johnson-like bound. Furthermore, it was shown that the efficient list decoding of cover metric codes up to the Johnson-like bound can be performed. From the work of Wachter-Zeh,
Shu Liu, Chaoping Xing, Chen Yuan
exaly +2 more sources
Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes
IEEE Transactions on Information Theory, 2022 We show that a relatively simple reasoning using von Neumann entropy inequalities yields a robust proof of the quantum Singleton bound for quantum error-correcting codes (QECC).
Markus Grassl +2 more
exaly +3 more sources
, 2013 The binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a Singleton bound for subspace codes mimic the technique used in obtaining the Singleton bound for binary codes.
Srikanth B. Pai +3 more
exaly +3 more sources
Singleton-type bounds for blot-correcting codes
IEEE Transactions on Information Theory, 1996Singleton-type bounds for blot-correcting codes are developed. The assumed channel causes dependent errors: an ``error event'' corrupts a number of elements in a given shape in the codeword, the so-called ``blot''. For example one-dimensional codewords with bursts of errors, two-dimensional codewords with two-dimensional bursts of rectangular (or ...
Martin Bossert, Vladimir Sidorenko
openaire +1 more source
Generalized Singleton Type Upper Bounds
IEEE Transactions on Information TheoryzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hao Chen 0029 +5 more
openaire +2 more sources
Improved Singleton-type bounds for list-decoding and average-radius list-decoding
2023 IEEE International Symposium on Information Theory (ISIT), 2023Haojie Gu, Hong Lu, Jun Zhang 0031
openaire +1 more source
Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
SIAM Journal on Computing, 2023Chong Shangguan, Itzhak Tamo
exaly