• DocumentCode
    2518135
  • Title

    Knuth’s balancing of codewords revisited

  • Author

    Weber, Jos H. ; Immink, Kees A Schouhamer

  • Author_Institution
    IRCTR/CWPC, Tech. Univ. Delft, Delft
  • fYear
    2008
  • fDate
    6-11 July 2008
  • Firstpage
    1567
  • Lastpage
    1571
  • Abstract
    In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of dasia1psilas and dasia-1psilas, called balanced codes. Knuthpsilas algorithm is, since look-up tables are absent, well suited for use with large codewords. The redundancy of Knuthpsilas balanced codes is a factor of two larger than that of a code comprising the full set of balanced codewords. In our paper we will present results of our attempts to improve the performance of Knuthpsilas balanced codes.
  • Keywords
    channel coding; matrix algebra; table lookup; Knuths algorithm; balanced codes; bipolar codewords; channel code; codewords revisited; constrained code; look-up tables; Channel capacity; Decoding; Magnetic recording; Optical receivers; Optical recording; Turing machines; Ultraviolet sources; balanced code; channel capacity; constrained code; magnetic recording; optical recording;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2008. ISIT 2008. IEEE International Symposium on
  • Conference_Location
    Toronto, ON
  • Print_ISBN
    978-1-4244-2256-2
  • Electronic_ISBN
    978-1-4244-2257-9
  • Type

    conf

  • DOI
    10.1109/ISIT.2008.4595251
  • Filename
    4595251
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2518135