A new linear block code construction technique is proposed [1]. It generates all the even codes of length greater than 8 with full information rate for Hamming distance-4. The codes generated by the proposed method include the extended Hamming codes and the Reed Muller codes of distance-4. The generator matrix has useful properties such as lowest density, quasi-cyclic and regular
Abstract—In this paper, for some linear block codes, two kinds of optimum distance profiles (ODPs) a...
International audienceReed Muller (RM) codes are known for their good minimum distance. One can use ...
Abstract—We propose a new type of short to moderate block-length, linear error-correcting codes, cal...
We propose a new heuristic construction technique that generates all the even codes of length greate...
We propose a new simple decomposable code construction technique that generates codes with the full ...
The minimum distance of linear block codes is one of the important parameter that indicates the erro...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
It is possible for a linear block code to provide more protection for selected message positions tha...
A new method using Hamming codes to construct base matrices of (J, K)-regular LDPC convolutional cod...
This is a comprehensive study of multiplicative codes of Reed-Muller type and their applications. O...
A new simple decomposable code construction technique, Geometric Augmented Product (GAP), is recentl...
[[abstract]]A general formula for the asymptotic largest minimum distance (in block length) of deter...
Several algorithms for constructing convolutional codes using block codes are given. The minimum dis...
This paper presents a combinatorial construction of low-density parity-check (LDPC) codes from parti...
Since Shannon's ground-breaking work in 1948, there have been two main development streams of channe...
Abstract—In this paper, for some linear block codes, two kinds of optimum distance profiles (ODPs) a...
International audienceReed Muller (RM) codes are known for their good minimum distance. One can use ...
Abstract—We propose a new type of short to moderate block-length, linear error-correcting codes, cal...
We propose a new heuristic construction technique that generates all the even codes of length greate...
We propose a new simple decomposable code construction technique that generates codes with the full ...
The minimum distance of linear block codes is one of the important parameter that indicates the erro...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
It is possible for a linear block code to provide more protection for selected message positions tha...
A new method using Hamming codes to construct base matrices of (J, K)-regular LDPC convolutional cod...
This is a comprehensive study of multiplicative codes of Reed-Muller type and their applications. O...
A new simple decomposable code construction technique, Geometric Augmented Product (GAP), is recentl...
[[abstract]]A general formula for the asymptotic largest minimum distance (in block length) of deter...
Several algorithms for constructing convolutional codes using block codes are given. The minimum dis...
This paper presents a combinatorial construction of low-density parity-check (LDPC) codes from parti...
Since Shannon's ground-breaking work in 1948, there have been two main development streams of channe...
Abstract—In this paper, for some linear block codes, two kinds of optimum distance profiles (ODPs) a...
International audienceReed Muller (RM) codes are known for their good minimum distance. One can use ...
Abstract—We propose a new type of short to moderate block-length, linear error-correcting codes, cal...
DOI
Add to ORKG