Results 251 to 260 of about 29,686,764 (312)
Some of the next articles are maybe not open access.
Decoding of M‐PSK‐Multilevel Codes
European Transactions on Telecommunications, 1993AbstractMultilevel codes give an impressive asymptotic coding gain measured in dB. However, when classical multistage decoding is used, this gain can only be partly realized at bit error rates (BER) around 10−5. It is shown how multistage decoding can be improved for this BER range.
Woerz, Th., Hagenauer, J.
openaire +2 more sources
On m-ary balanced codes with parallel decoding
2010 IEEE International Symposium on Information Theory, 2010An m-ary block code, m = 2, 3, 4, …, of length n ∈ IN is called balanced if, and only if, every codeword is balanced; that is, the real sum of the codeword components, or weight, is equal to ⌊(m − 1)n/2⌋. This paper presents a tight generalization of Knuth's complementation method with parallel (hence, fast) decoding scheme.
PELUSI, DANILO, TALLINI, Luca, B. BOSE
openaire +2 more sources
Euclidean and Hermitian LCD MDS codes
Des. Codes Cryptogr., 2017Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks.
C. Carlet +3 more
semanticscholar +1 more source
On the capacity of M-ary run-length-limited codes
Proceedings of 1995 IEEE International Symposium on Information Theory, 1995Summary: In this correspondence we present two results on the Shannon capacity of \(M\)-ary \((d,k)\) codes. First we show that 100\% efficient fixed-rate codes are impossible for all values of \((M, d, k)\), \(0\leq d< k< \infty\), \(M< \infty\), thereby extending a result of \textit{J. Ashley} and \textit{P. Siegel} [ibid. 33, 601-605 (1987; Zbl 0631.
Steven W. McLaughlin, Jian Luo, Qun Xie
openaire +1 more source
Discrete Mathematics, Algorithms and Applications, 2019
Let [Formula: see text] be the ring [Formula: see text]. We study cyclic codes of arbitrary length [Formula: see text] over the ring [Formula: see text] and obtain a complete characterization for them by presenting a unique set of generators for these codes.
openaire +2 more sources
Let [Formula: see text] be the ring [Formula: see text]. We study cyclic codes of arbitrary length [Formula: see text] over the ring [Formula: see text] and obtain a complete characterization for them by presenting a unique set of generators for these codes.
openaire +2 more sources
Cyclic codes and some new entanglement-assisted quantum MDS codes
Designs, Codes and Cryptography, 2020Entanglement-assisted quantum error correcting codes (EAQECCs) play a significant role in protecting quantum information from decoherence and quantum noise.
Wan Jiang, Shixin Zhu, Xiaojing Chen
semanticscholar +1 more source
A Class of Narrow-Sense BCH Codes
IEEE Transactions on Information Theory, 2019BCH codes are an important class of cyclic codes which have applications in satellite communications, DVDs, disk drives, and two-dimensional bar codes. Although BCH codes have been widely studied, their parameters are known for only a few special classes.
Shixin Zhu, Zhonghua Sun, X. Kai
semanticscholar +1 more source
On Two Classes of Primitive BCH Codes and Some Related Codes
IEEE Transactions on Information Theory, 2019BCH codes are an interesting type of cyclic codes and have wide applications in communication and storage systems. Generally, it is very hard to determine the minimum distances of BCH codes.
Chengju Li, Peng Wu, Fengmei Liu
semanticscholar +1 more source
Second-order coding rate for m-class source-channel codes
2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015The second-order coding rate for source-channel codes with m levels of unequal message protection (UMP) is derived. The second-order coding rate takes the form of an optimization problem which reduces to separate source-channel coding rate for m = 2. A procedure for solving the given optimization problem is proposed. The proposed procedure exploits the
Yanina Y. Shkel +2 more
openaire +1 more source
Multistage index assignments for M-description coding
Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429), 2004We consider the problem of generalized multiple description coding of image data, in which an image is encoded into M descriptions sent over M unreliable channels, and any description subset is useful in reconstructing an approximation of the original image.
openaire +2 more sources