Incomplete sums, DC-constrained codes, and codes that maintain synchronization

DOI10.1007/BF01388409zbMath0772.94016MaRDI QIDQ1802188

Alexander Barg

Publication date: 14 October 1993

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

exponential sumsfinite fieldcomma-free codessynchronization errorsincomplete sumscharacters of polynomialserror-correcting dc-constrained codesnonprime fields

Mathematics Subject Classification ID

Other types of codes (94B60) Prefix, length-variable, comma-free codes (94A45)

Related Items (1)

A large family of sequences with low periodic correlation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equations over finite fields. An elementary approach
• Character sums and primitive roots in finite fields
• Comma-Free Codes
• DC-constrained codes from Hadamard matrices
• Efficient balanced codes
• An Asymptotic Lower Bound for the Character Sums induced by the Legendre Symbol
• Some lower bounds on the number of code points in a minimum distance binary code. I
• Information rates and power spectra of digital codes
• On error-correcting balanced codes
• Balanced nonbinary sequences with good periodic correlation properties obtained from modified Kumar-Moreno sequences

This page was built for publication: Incomplete sums, DC-constrained codes, and codes that maintain synchronization