Results 31 to 40 of about 1,011,482 (281)

Low-Complexity LP Decoding of Nonbinary Linear Codes [PDF]

, 2013
Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes.
Mark F. Flanagan, Mayur Punekar, Pascal O. Vontobel, Senior Member, Senior Member, Student Member   +5 more
core   +1 more source

On the Covering Dimension of a Linear Code [PDF]

IEEE Transactions on Information Theory, 2016
The critical exponent of a matroid is one of the important parameters in matroid theory and is related to the Rota and Crapo's Critical Problem. This paper introduces the covering dimension of a linear code over a finite field, which is analogous to the critical exponent of a representable matroid.
Britz, T, Shiromoto, K
openaire   +3 more sources

Optimal Linear Codes and Their Hulls

Mathematics
The hull of a linear code C is the intersection of C with its dual code. The goal is to study the dimensions of the hulls of optimal binary and ternary linear codes for a given length and dimension.
Stefka Bouyuklieva, Mariya Dzhumalieva-Stoeva   +1 more
doaj   +1 more source

Quantum Stabilizer Codes and Classical Linear Codes

, 1996
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes.
A. Ekert, A.M. Steane, A.R. Calderbank, C.E. Shannon, C.E. Shannon, C.H. Bennett, D. Gottesman, D.P. DiVincenzo, F.J. MacWilliams, J.H. van Lint, P.W. Shor, R. Laflamme, R.J. McEliece, Richard Cleve   +13 more
core   +3 more sources

Constant composition codes as subcodes of linear codes [PDF]

Journal of Applied Mathematics and Computing, 2019
13pages
Long Yu, Xiusheng Liu
openaire   +2 more sources

Linear Codes and Self-Polarity

Mathematics
This work studies projective self-dual (PSD) and self-polar linear codes over finite fields with q elements, where q is a power of a prime. The possible parameters for which PSD codes may exist are presented, and many examples are provided.
Iliya Bouyukliev, Stefka Bouyuklieva, Mariya Dzhumalieva-Stoeva, Dushan Bikov   +3 more
doaj   +1 more source

Code multiplexing using linear block codes [PDF]

EPJ Web of Conferences
This paper explores the application of code multiplexing using linear block codes in communication systems. Through a comprehensive analysis of contemporary literature on switching methods and signal modeling, the study investigates the principles of ...
Rabin Alexey, Rabin Sergei, Zyulkov Arseniy   +2 more
doaj   +1 more source

Design of Non-Adaptive Querying Policies Based on Error Control Coding

IEEE Access, 2020
This paper designs non-adaptive querying policies (NQPs) for the noisy 20 questions game based on error-correction codes. The querying accuracy of a specific NQP is upper bounded by a function of the minimum distance among its codewords. As a result, the
Shuai Wang, Qin Huang, Simeng Zheng, Zulin Wang   +3 more
doaj   +1 more source

Computing Extensions of Linear Codes

, 2007
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented.
Grassl, Markus
core   +1 more source

The extended codes of some linear codes

Finite Fields and Their Applications
The classical way of extending an $[n, k, d]$ linear code $\C$ is to add an overall parity-check coordinate to each codeword of the linear code $\C$. This extended code, denoted by $\overline{\C}(-\bone)$ and called the standardly extended code of $\C$, is a linear code with parameters $[n+1, k, \bar{d}]$, where $\bar{d}=d$ or $\bar{d}=d+1$.
Zhonghua Sun 0001, Cunsheng Ding, Tingfang Chen   +2 more
openaire   +3 more sources