Jun 22, 2005 · We show also that constructed codes are comma-free and detect synchronization errors even at high rate of additive errors. To prove these ...
We show also that constructed codes are comma-free and detect synchronization errors even at high rate of additive errors. To prove these properties of ...
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.
“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.
How various cryptographic and coding theory problems lead to questions about exponential sums. Unfortunately there is no systematic textbook on exponential sums ...
People also ask
What are the different types of error correcting codes?
What is the error correcting code in math?
What is error correcting code in coding theory?
Which mathematical concept is the basis for error correcting codes used in computer science?
Abstract. A bound is obtained which generalizes the Carlitz-Uchiyama result, based on a theorem of Bombieri and Weil about exponential sums. This new.
Missing: Constrained | Show results with:Constrained
Abstract. We study two families of error-correcting codes defined in terms of very sparse matrices. 'MN' (MacKay-Neal) codes are recently invented, ...