×
Jun 22, 2005 · We present a number of new families of k-ary dc-constrained errorcorrecting codes with distance d > (k − 1)n/k − α 1 (n) √n and running ...
In Section 3, we show that some error-correcting dc-constrained codes of the type (1)-(2) are comma-free and estimate their code separation. 2. LIST OF DC- ...
We estimate parameters of constrained error-correcting codes constructed by means of additive and multiplicative characters. To get the bounds we derive ...
Exponential Sums and Constrained Error-Correcting Codes · PREVIOUS ARTICLE · NEXT ARTICLE.
“Exponential sums and constrained error-correcting codes” is a paper by Alexander Barg published in 1992. It has an Open Access status of “closed”. You can read ...
Bibliographic details on Exponential Sums and Constrained Error-Correcting Codes.
Sloane, The theory of error-correcting codes,. North-Holland, Amsterdam, 1977. [63] Mazur L., 'On some codes correcting asymmetrical errors', Problemy.
People also ask
Video for Exponential Sums and Constrained Error-Correcting Codes.
Duration: 1:14:52
Posted: Apr 25, 2023
Missing: Exponential Sums Constrained
Abstract. We study two families of error-correcting codes defined in terms of very sparse matrices. 'MN' (MacKay-Neal) codes are recently invented, ...
In coding theory, the Bose–Chaudhuri–Hocquenghem codes (BCH codes) form a class of cyclic error-correcting codes that are constructed using polynomials over ...