Results 41 to 50 of about 35,710 (296)
Low-Floor Tanner Codes via Hamming-Node or RSCC-Node Doping [PDF]
, 2006 We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the “doping” of standard LDPC (proto-)graphs, by which we mean Hamming or recursive systematic convolutional (RSC) code ...
Ryan, William E. +5 more
core +1 more source
International Journal of Multidisciplinary Research and Analysis, 2022 Coding theory (English: coding theory) is a branch of mathematics (mathematics) and computer science (computer science) that deals with error-prone situations in the process of transmitting data over communication channels. noise channels), using sophisticated methods that make the majority of errors that occur can be corrected.
Tran Van Anh +4 more
openaire +4 more sources
Indecomposability of cyclic codes
Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshimi Kashiwagi, Isao Kikumasa
openaire +1 more source
Sum-Rank BCH Codes and Cyclic-Skew-Cyclic Codes [PDF]
IEEE Transactions on Information Theory, 2021 Lemma 26 has been rewritten with respect to the previous ...
openaire +2 more sources
Constructions of cyclic codes and extended primitive cyclic codes with their applications
Finite Fields and Their Applications, 2023 Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on special polynomials over finite fields.
Ziling Heng, Xinran Wang, Xiaoru Li
openaire +3 more sources
How to Generate Cyclically Permutable Codes From Cyclic Codes [PDF]
IEEE Transactions on Information Theory, 2006 On the basis of the characteristics of cyclic codes, the codeword space can be partitioned into small subspaces where cyclically shifted codewords of a particular codeword occupy the same subspace. A cyclically permutable code generates codewords belonging to each subspace.
Minoru Kuribayashi, Hatsukazu Tanaka
openaire +1 more source
, 1995 Derives an estimate for the error term in the binomial approximation of spectra of BCH codes. This estimate asymptotically improves on the bounds by Sidelnikov (1971), Kasami et al. (1985), and Sole (1990)
Krasikov, I +3 more
core +1 more source
Classification of self-dual cyclic codes over the chain ring Z(p)[u]/< u(3)> [PDF]
, 2021 We classify all the cyclic self-dual codes of length p(k) over the finite chain ring R := Z(p)[u]/< u(3)>, which is not a Galois ring, where p is a prime number and k is a positive integer.
이윤진
core +1 more source
Optimal quinary cyclic codes with minimum distance four
Tongxin xuebao, 2017 Cyclic codes are an extremely important subclass of linear codes.They are widely used in the communication systems and data storage systems because they have efficient encoding and decoding algorithm.Until now,how to construct the optimal ternary cyclic ...
Ye TIAN, Yu-qing ZHANG, Yu-pu HU
doaj +2 more sources
Monomial codes seen as invariant subspaces
Open Mathematics, 2017 It is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known.
García-Planas María Isabel +2 more
doaj +1 more source