Results 91 to 100 of about 139,535 (196)
MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes [PDF]
arXiv, 2020 Self-dual maximum distance separable codes (self-dual MDS codes) and self-dual near MDS codes are very important in coding theory and practice. Thus, it is interesting to construct self-dual MDS or self-dual near MDS codes. In this paper, we not only give check matrices of dual codes of twisted generalized Reed-Solomon codes (TGRS codes) but also ...
arxiv
, 2012 This paper is concerned with general analysis on the rank and row-redundancy of an array of circulants whose null space defines a QC-LDPC code. Based on the Fourier transform and the properties of conjugacy classes and Hadamard products of matrices, we ...
Huang, Qin, Liu, Keke, Wang, Zulin
core
Quasi-Cyclic Asymptotically Regular LDPC Codes
, 2010 Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles with varying ...
Costello Jr, Daniel J. +3 more
core +1 more source
AI Coding: Learning to Construct Error Correction Codes [PDF]
arXiv, 2019 In this paper, we investigate an artificial-intelligence (AI) driven approach to design error correction codes (ECC). Classic error correction code was designed upon coding theory that typically defines code properties (e.g., hamming distance, subchannel reliability, etc.) to reflect code performance.
arxiv
Twisted Reed-Solomon Codes With One-dimensional Hull [PDF]
arXiv, 2020 The hull of a linear code is defined to be the intersection of the code and its dual. When the size of the hull is small, it has been proved that some algorithms for checking permutation equivalence of two linear codes and computing the automorphism group of a linear code are very effective in general.
arxiv
Explicit constructions of Type-II QC LDPC codes with girth at least 6 [PDF]
, 2007 Type-II quasi-cyclic (QC) LDPC codes are constructed from combinations of weight-0, weight-1 and weight-2 circulant matrices. The structure of cycles of length 2n are investigated, and necessary and sufficient conditions for a type-II QC LDPC parity ...
Lally, K
core
Generalized Adaptive Network Coded Cooperation (GANCC): A Unified Framework for Network Coding and Channel Coding [PDF]
arXiv, 2010 This paper considers distributed coding for multi-source single-sink data collection wireless networks. A unified framework for network coding and channel coding, termed "generalized adaptive network coded cooperation" (GANCC), is proposed. Key ingredients of GANCC include: matching code graphs with the dynamic network graphs on-the-fly, and ...
arxiv
Optimized Puncturing of the Check Matrix for Rate-Compatible LDPC Codes
MATEC Web of Conferences, 2018 In the wireless communication system, it is necessary to change the transmitted code word or code rate in real time according to the channel environment, designing and implementing rate compatible codes is of great practical significance.
Zhang Liang, Meng Jiahui, Zhao Danfeng
doaj +1 more source
Entanglement-assisted Quantum Codes from Cyclic Codes [PDF]
arXiv, 2019 Entanglement-assisted quantum (QUENTA) codes are a subclass of quantum error-correcting codes which use entanglement as a resource. These codes can provide error correction capability higher than the codes derived from the traditional stabilizer formalism.
arxiv
, 2017 Parameters of LDPC codes, such as minimum distance, stopping distance, stopping redundancy, girth of the Tanner graph, and their influence on the frame error rate performance of the BP, ML and near-ML decoding over a BEC and an AWGN channel are studied ...
A Orlitsky +19 more
core +1 more source