Results 101 to 110 of about 139,535 (196)

Construction of Error-Correcting Codes for Random Network Coding [PDF]

open access: yesarXiv, 2008
In this work we present error-correcting codes for random network coding based on rank- metric codes, Ferrers diagrams, and puncturing. For most parameters, the constructed codes are larger than all previously known codes.
arxiv  

Time-Invariant Spatially Coupled Low-Density Parity-Check Codes with Small Constraint Length

open access: yes, 2016
We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping procedures ...
Baldi, Marco   +3 more
core   +1 more source

A Practical Approach to Polar Codes [PDF]

open access: yesarXiv, 2011
In this paper, we study polar codes from a practical point of view. In particular, we study concatenated polar codes and rate-compatible polar codes. First, we propose a concatenation scheme including polar codes and Low-Density Parity-Check (LDPC) codes.
arxiv  

Circulant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes

open access: yes, 2010
This paper consists of three parts. The first part presents a large class of new binary quasi-cyclic (QC)-LDPC codes with girth of at least 6 whose parity-check matrices are constructed based on cyclic subgroups of finite fields.
Abdel-Ghaffar, Khaled   +4 more
core  

Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency Communications

open access: yes, 2018
Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special quasi-cyclic low ...
Baldi, Marco   +4 more
core   +1 more source

On dually almost MRD codes [PDF]

open access: yesarXiv, 2016
In this paper we define and study a family of codes which come close to be MRD codes, so we call them AMRD codes (almost MRD). An AMRD code is a code with rank defect equal to 1. AMRD codes whose duals are AMRD are called dually AMRD. Dually AMRD codes are the closest to the MRD codes given that both they and their dual codes are almost optimal ...
arxiv  

Fault-tolerant conversion between stabilizer codes by Clifford operations [PDF]

open access: yesarXiv, 2015
We propose a scheme that converts a stabilizer code into another stabilizer code in a fault tolerant manner. The scheme first puts both codes in specific forms, and proceeds the conversion from a source code to a target code by applying Clifford gates. The Clifford gates are chosen from the comparisons between both codes.
arxiv  

Low Complexity Encoder of High Rate Irregular QC-LDPC Codes for Partial Response Channels

open access: yesAdvances in Electrical and Computer Engineering, 2011
High rate irregular QC-LDPC codes based on circulant permutation matrices, for efficient encoder implementation, are proposed in this article. The structure of the code is an approximate lower triangular matrix.
IMTAWIL, V., MEESOMBOON, A., KUPIMAI, M.
doaj   +1 more source

Codes induced by alternative codes [PDF]

open access: yesarXiv, 2018
Alternative codes, an extension of the notion of ordinary codes, have been first introduced and considered by P. T. Huy et al. in 2004. As seen below, every alternative code, in its turn, defines an ordinary code. Such codes are called codes induced by alternative codes or alt-induced codes, for short.
arxiv  

Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices

open access: yesIEEE Access, 2018
In this paper, we define two “difference matrices” which correspond to an exponent matrix. We present necessary and sufficient conditions for these difference matrices to have quasi-cyclic low-density parity-check codes (QC-LDPC) codes with
Farzane Amirzade, Mohammad-Reza Sadeghi
doaj   +1 more source

Home - About - Disclaimer - Privacy