Codes generated by matrix expansions
نویسنده
چکیده
A new class of error-correcting codes is created from a matrix operation defined within. The matrix operation takes a point-block incidence and produces a new point-block incidence with some desirable properties, including a doubling of the girth of the Tanner graph of the initial matrix. A specific example is created using PG(2, q), and the results are generalized to any point-block incidence structure. These codes are analyzed mathematically and through simulation via belief propagation decoding.
منابع مشابه
Nonharmonic Gabor Expansions
We consider Gabor systems generated by a Gaussian function and prove certain classical results of Paley and Wiener on nonharmonic Fourier series of complex exponentials for the Gabor expansion. In particular, we prove a version of Plancherel-Po ́lya theorem for entire functions with finite order of growth and use the Hadamard factorization theorem to study regularity, exactness and deficienc...
متن کاملDecay of Correlations for Sparse Graph Error Correcting Codes
The subject of this paper is transmission over a general class of binary-input memoryless symmetric channels using error correcting codes based on sparse graphs, namely low-density generator-matrix and low-density parity-check codes. The optimal (or ideal) decoder based on the posterior measure over the code bits, and its relationship to the sub-optimal belief propagation decoder, are investiga...
متن کاملSelf-dual Z4 codes of Type IV generated by skew-Hadamard matrices and conference matrices
In this paper, we give families of self-dual Z4-codes of Type IV-I and Type IV-II generated by conference matrices and skew-Hadamard matrices. Furthermore, we give a family of self-dual Z4-codes of Type IV-I generated by bordered skew-Hadamard matrices.
متن کاملBinary Codes of Strongly Regular Graphs
For strongly regular graphs with adjacency matrix A, we look at the binary codes generated by A and A+ I . We determine these codes for some families of graphs, we pay attention to the relation between the codes of switching equivalent graphs and, with the exception of two parameter sets, we generate by computer the codes of all known strongly regular graphs on fewer than 45 vertices.
متن کاملA New Class of Irregular Low-Density Parity-Check Codes With Linear Encoding Complexity
In this paper we propose a new class of irregular low-density parity check (LDPC) codes with linear encoding complexity. We show that these codes offer performances compatible with irregular LDPC codes with randomly generated parity-check matrices. The non-systematic part of the paritycheck matrix has a simple triangular structure, which enables linear encoding, while the systematic part of the...
متن کامل