scientific article; zbMATH DE number 910951

MaRDI QIDQ4886128zbMATH OpenFDO

Authors Alexander Barg

Publication date 9 April 1997

zbMATH Keywords

\(k\)-ary dc-constrained error-correcting codesinequalities for incomplete sums of characters of polynomials

Mathematics Subject Classification ID

Exponential sums (11T23) Other types of codes (94B60)

Recommendations

• Incomplete sums, DC-constrained codes, and codes that maintain synchronization
• scientific article; zbMATH DE number 953231
• Character sum constructions of constrained error-correcting codes
• DC-free error-correcting codes based on convolutional codes
• Constructions of error-correcting DC-free block codes

Cited in

(9)

• Character sum constructions of constrained error-correcting codes
• Incomplete sums, DC-constrained codes, and codes that maintain synchronization
• Error correcting codes from sub-exceeding functions
• Iterated logarithmic expansions of the pathwise code lengths for exponential families
• Exponential sums, Gauss sums and cyclic codes
• Tree codes and a conjecture on exponential sums
• Error-correcting codes with bounded running digital sum
• Error exponents of expander codes
• On asymptotics of certain sums arising in coding theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886128)