Exponential sums and constrained error-correcting codes
A Barg - Algebraic Coding: First French-Soviet Workshop Paris …, 1992 - Springer
Algebraic Coding: First French-Soviet Workshop Paris, July 22–24, 1991 …, 1992•Springer
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 digital sum≅ α 2 (n)√ n, where α 1 and α 2
are slowly growing functions in the code length n. 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 constructed codes, we apply some well-known inequalities for
incomplete sums of characters of polynomials.
distance d>(k− 1) n/k− α 1 (n)√ n and running digital sum≅ α 2 (n)√ n, where α 1 and α 2
are slowly growing functions in the code length n. 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 constructed codes, we apply some well-known inequalities for
incomplete sums of characters of polynomials.
Abstract
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 digital sum ≅ α2(n) √n, where α1 and α2 are slowly growing functions in the code length n. 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 constructed codes, we apply some well-known inequalities for incomplete sums of characters of polynomials.
Springer
Showing the best result for this search. See all results