Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Reports, Documentation, and Standards
  4. Polarity-Balanced Codes
 
report

Polarity-Balanced Codes

Weber, Jos H.
•
Siegel, Paul H.
•
Immink, Kees A. S.
Show more
2013

Balanced bipolar codes consist of sequences in which the symbols ‘−1’ and ‘+1’ appear equally often. Several generalizations to larger alphabets have been considered in literature. For example, for the q-ary alphabet {−q+1,−q+3, . . . , q−1}, known concepts are symbol balancing, i.e., all alphabet symbols appear equally often in each codeword, and charge balancing, i.e., the symbol sum in each codeword equals zero. These notions are equivalent for the bipolar case, but not for q > 2. In this paper, a third perspective is introduced, called polarity balancing, where the number of positive symbols equals the number of negative symbols in each codeword. The minimum redundancy of such codes is determined and a generalization of Knuth’s celebrated bipolar balancing algorithm is proposed.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

ITA2013 Weber Immink Siegel Swart paper_326-1.pdf

Type

Preprint

Version

http://purl.org/coar/version/c_71e4c1898caa6e32

Access type

openaccess

Size

75 KB

Format

Adobe PDF

Checksum (MD5)

4734a226e554db70f5642215aa173a4f

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés