Results 241 to 250 of about 42,243 (288)
Some of the next articles are maybe not open access.
Maximum Distance Separable Convolutional Codes
Applicable Algebra in Engineering, Communication and Computing, 1999A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all linear block codes of rate \(k/n\). It is well known that MDS block codes do exist if the field size is greater than \(n\). In this paper this concept is generalized to the class of convolutional codes of a fixed rate \(k/n\) and a fixed code degree ...
J. Rosenthal, R. Smarandache
semanticscholar +3 more sources
Maximum distance separable codes over ℤ2 × ℤ2s
Journal of Algebra and Its Applications, 2017Bilal et al. (Maximum distance separable codes over [Formula: see text] and [Formula: see text] Des. Codes Cryptogr. 61 (2011) 31–40) obtained two upper bounds on minimum distance of codes over rings to the case of [Formula: see text]-additive codes and ...
K. Samei, S. Sadeghi
semanticscholar +2 more sources
Improved constructions for quantum maximum distance separable codes
Quantum Information Processing, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfa Qian, Lina Zhang
semanticscholar +2 more sources
Application of constacyclic codes to entanglement-assisted quantum maximum distance separable codes
Quantum Information Processing, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang Liu +3 more
semanticscholar +2 more sources
Maximum distance separable multilevel codes
IEEE Transactions on Information Theory, 1984A class of t error-correcting pseudocyclic multilevel codes is introduced. These are maximum-distance separable random-error-correcting codes with qm symbols, where q is a prime number. The construction of seven-level codes is presented as an example.
V. C. Rocha
semanticscholar +2 more sources
Maximum distance separable poset codes
Designs, Codes and Cryptography, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. Hyun, H. Kim
semanticscholar +4 more sources
Maximum distance separable codes
Elements of Algebraic Coding Theory, 2022L. Vermani
semanticscholar +2 more sources
On maximum-distance-separable convolutional codes (Corresp.)
IEEE Transactions on Information Theory, 1974We define maximum-distance-separable convolutional codes as systematic codes with (feedback) minimum distance exceeding the number of check digits in a constraint length. The maximum length of such codes is determined for certain small fields when the rate is \frac{1}{2} .
J. Justesen, L. R. Hughes
semanticscholar +2 more sources
On maximum distance separable codes over alphabets of arbitrary size
Proceedings of 1994 IEEE International Symposium on Information Theory, 1994The well-known Singleton bound states that the cardinality of a code of length n with minimum distance d over a q-ary alphabet is at most q/sup n-d+1/. Codes meeting the Singleton bound with equality are called maximum distance separable codes, or MDS codes for short.
L. Tolhuizen
semanticscholar +2 more sources
Rate $(n-1)/n$ Systematic Memory Maximum Distance Separable Convolutional Codes
IEEE Transactions on Information Theory, 2018A systematic convolutional encoder of rate $(n-1)/n$ and maximum memory $D$ generates a code of free distance at most ${\mathcal{ D}} = D+2$ and, at best, a column distance profile (CDP) of $[2,3,\ldots,{\mathcal{ D}}]$ . A code is memory maximum distance separable if it possesses this CDP.
A. Barbero, Øyvind Ytrehus
semanticscholar +2 more sources