Results 251 to 260 of about 42,243 (288)
Some of the next articles are maybe not open access.
Maximum Distance Separable Codes Based on Circulant Cauchy Matrices
Colloquium on Structural Information & Communication Complexity, 2013We present a maximum-separable-distance (MDS) code suitable for computing erasure resilient codes for large word lengths. Given n data blocks (words) of any even bit length w the Circulant Cauchy Codes compute m ≤ w + 1 code blocks of bit length w using XOR-operations, such that every combination of n data words and code words can reconstruct all data ...
C. Schindelhauer, C. Ortolf
semanticscholar +3 more sources
On decoding of maximum-distance separable linear codes
IEEE Transactions on Information Theory, 1971In this paper, some properties of maximum-distance separable linear codes are presented. Based on these properties, a decoding algorithm for correcting random errors is established. A simpler decoding algorithm for correcting burst errors is also given.
S. Yau, Yu-cheng Liu
semanticscholar +2 more sources
Exact analysis of bit error rate of maximum-distance-separable codes
Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), 2000We present a formula to calculate the bit error rate (BER) of maximum-distance-separable (MDS) codes based on the weight distributions of the codes. Because of the exact number of a certain weight of the codes, the probabilities of decoding error and decoding failure can be achieved for an incomplete decoder. The proposed formula is built by summing up
Lijun Zhang, Chun-Yan Gao, Z. Cao
semanticscholar +2 more sources
IEEE Communications Letters, 2023
We propose a deterministic decoding scheme to correct a block of deletions/insertions of length up to $N-K=\lceil 0.5\pi _{L}\rceil -1$ with a high probability for the de Bruijn symbol-maximum distance separable (DB-MDS $(N,K,\pi _{L})$ ) codes. The DB-
Chen Yi +5 more
semanticscholar +1 more source
We propose a deterministic decoding scheme to correct a block of deletions/insertions of length up to $N-K=\lceil 0.5\pi _{L}\rceil -1$ with a high probability for the de Bruijn symbol-maximum distance separable (DB-MDS $(N,K,\pi _{L})$ ) codes. The DB-
Chen Yi +5 more
semanticscholar +1 more source
Generation Of Maximum Distance Separable Codes
Proceedings. 1991 IEEE International Symposium on Information Theory, 1990G. Solomon
semanticscholar +2 more sources
Points in Uniform Position and Maximum Distance Separable Codes
, 1994J. Hansen, F. Orecchia, L. Chiantini
semanticscholar +4 more sources
A Novel Maximum Distance Separable Code Based RIS-OFDM: Design and Optimization
Global Communications Conference, 2022In this paper, we propose a novel maximum distance separable (MDS) code based and reconfigurable intelligent surface (RIS) assisted wireless communication system with orthogonal frequency division multiplexing (OFDM). Specifically, input bits are firstly
Yiqian Huang +5 more
semanticscholar +1 more source
On maximum distance separable and completely regular codes
arXiv.orgWe investigate when a maximum distance separable ($MDS$) code over $F_q$ is also completely regular ($CR$). For lengths $n=q+1$ and $n=q+2$ we provide a complete classification of the $MDS$ codes that are $CR$ or at least uniformly packed in the wide ...
Joaquim Borges, J. Rifà, V. Zinoviev
semanticscholar +1 more source
Arbitrary rate maximum-distance separable wavelet codes
IEEE International Conference on Acoustics Speech and Signal Processing, 2002This paper expands on the idea of wavelet coding. It undertakes construction of arbitrary rate error correcting codes using finite-field wavelets and filter banks. We show that a rate K / L code can be constructed by a combination of a K-band trivial analysis bank and an L-band synthesis bank.
openaire +2 more sources
A note on maximum distance separable (optimal) codes (Corresp.)
IEEE Transactions on Information Theory, 1983Given a positive integer k and a prime power q with q \leq k , it is proved that the largest value of n for which there exists an [n,k,n-k+l] maximum distance separable (MDS) code over GF (q) is k+1 . A simple proof for the largest value of n for which there exists an [n,2,n-1] MDS code over any finite field is also given.
L. Vermani, S. Jindal
openaire +1 more source