Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
338
An Authentication Scheme Based on an Low-Density Parity-Check Matrix
"... Abstract — In this paper, an authentication scheme based on an LDPC (Low-Density Parity-Check) matrix is presented. Upper bounds on probabilities of impersonate attack and substitution attack have been derived using combinatorial argument on an LDPC ensemble. I. ..."
Abstract
- Add to MetaCart
Abstract — In this paper, an authentication scheme based on an LDPC (Low-Density Parity-Check) matrix is presented. Upper bounds on probabilities of impersonate attack and substitution attack have been derived using combinatorial argument on an LDPC ensemble. I.
Codes with a circulant parity check matrix
"... In this work we study codes characterized by the property that their parity check matrix is circulant, i.e., that rows are obtained as all the distinct cyclic shifts of the first row. For these codes, we give simple expressions for their dimension and for a lower bound on their minimum distance. We ..."
Abstract
- Add to MetaCart
In this work we study codes characterized by the property that their parity check matrix is circulant, i.e., that rows are obtained as all the distinct cyclic shifts of the first row. For these codes, we give simple expressions for their dimension and for a lower bound on their minimum distance. We
DRAFT SUBMITTED TO IEEE TRANSACTIONS ON SIGNAL PROCESSING 1 Parity-Check Matrix Calculation for
, 2008
"... Joint source-channel coding schemes based on oversampled filter banks were recently proposed. Oversampled filter banks are considered as error-correcting codes, extending the notion of code-subspace, parity-check matrix, and syndrom to the domain of real and complex numbers. We here present an effic ..."
Abstract
- Add to MetaCart
Joint source-channel coding schemes based on oversampled filter banks were recently proposed. Oversampled filter banks are considered as error-correcting codes, extending the notion of code-subspace, parity-check matrix, and syndrom to the domain of real and complex numbers. We here present
Iterative Soft Input Soft Output Decoding of Reed-Solomon Codes by Adapting the Parity Check Matrix
, 2005
"... An iterative algorithm is presented for soft input soft output (SISO) decoding of Reed-Solomon (RS) codes. The proposed algorithm works at the bit level using the binary parity check matrix associated with the RS code. The novelty in the proposed algorithm is in reducing a submatrix of the binary pa ..."
Abstract
-
Cited by 30 (1 self)
- Add to MetaCart
An iterative algorithm is presented for soft input soft output (SISO) decoding of Reed-Solomon (RS) codes. The proposed algorithm works at the bit level using the binary parity check matrix associated with the RS code. The novelty in the proposed algorithm is in reducing a submatrix of the binary
A Parity Check Matrix Design for Irregular LDPC Codes with 2K Block Length
, 2009
"... This paper outlines the work on another design of a parity check matrix for Irregular LDPC codes. The design is based on the pattern of Modified Array and Interleaved Modified Array LDPC codes. The application of matrix transposition Quasi-cyclic shifting has resulted in the reduction of 1’s. The d ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
This paper outlines the work on another design of a parity check matrix for Irregular LDPC codes. The design is based on the pattern of Modified Array and Interleaved Modified Array LDPC codes. The application of matrix transposition Quasi-cyclic shifting has resulted in the reduction of 1’s
(1) Let Gi,Hi be the generator matrix and parity check matrix of Ci respectively, (i=1,2). Without loss of generality,
"... between two distinct codewords, then C is called an [n,k,d] linear code over F 2. A linear code C is always specified by an n by k generator matrix G whose entries are all zeroes and ones. The generator matrix G maps k bits of information to a set of binary vectors of length n, called codewords. Bin ..."
Abstract
- Add to MetaCart
. Binary linear codes can be alternatively (but equivalently) formulated by so called parity matrix, which is used to perform error-correction. The parity matrix H of a linear code [n,k] is an (n−k)×n matrix such that Hx=0 for all those and only those vectors x in the code C. The rows of H are n−k linearly
A Standard Generator/Parity Check Matrix for Codes from the Cayley Tables Due to the Non-associative (123)-Avoiding Patterns of AUNU Numbers
, 2016
"... Abstract In this paper, we aim at utilizing the Cayley tables demonstrated by the Authors ..."
Abstract
- Add to MetaCart
Abstract In this paper, we aim at utilizing the Cayley tables demonstrated by the Authors
A design of parity check matrix for short irregular LDPC codes via magic square based algorithm, International Journal of electronics and communication engineering & technology (IJECET) 4(1
, 2013
"... ABSTRACT This paper presents a construction algorithm for the short block irregular low-density parity-check (LDPC) codes. By applying a magic square theorem as a part of the matrix construction, a newly developed algorithm, the so-called Magic Square Based Algorithm (MSBA), is obtained. The modifi ..."
Abstract
- Add to MetaCart
ABSTRACT This paper presents a construction algorithm for the short block irregular low-density parity-check (LDPC) codes. By applying a magic square theorem as a part of the matrix construction, a newly developed algorithm, the so-called Magic Square Based Algorithm (MSBA), is obtained
Results 1 - 10
of
338
