• DocumentCode
    3493962
  • Title

    Optimizing the free distance of Error-Correcting Variable-Length Codes

  • Author

    Diallo, Amadou ; Weidmann, Claudio ; Kieffer, Michel

  • Author_Institution
    L2S - CNRS - SUPELEC, Univ Paris-Sud, Gif-sur-Yvette, France
  • fYear
    2010
  • fDate
    4-6 Oct. 2010
  • Firstpage
    245
  • Lastpage
    250
  • Abstract
    This paper considers the optimization of Error-Correcting Variable-Length Codes (EC-VLC), which are a class of joint-source channel codes. The aim is to find a prefix-free codebook with the largest possible free distance for a given set of codeword lengths, ℓ = (ℓ1, ℓ2, ..., ℓM). The proposed approach consists in ordering all possible codebooks associated to ℓ on a tree, and then to apply an efficient branch-and-prune algorithm to find a codebook with maximal free distance. Three methods for building the tree of codebooks are presented and their efficiency is compared.
  • Keywords
    combined source-channel coding; error correction codes; variable length codes; branch-and-prune algorithm; error-correcting variable-length codes; joint-source channel codes; maximal free distance; prefix-free codebook; Channel coding; Hamming distance; Optimization; Redundancy; Tree data structures; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multimedia Signal Processing (MMSP), 2010 IEEE International Workshop on
  • Conference_Location
    Saint Malo
  • Print_ISBN
    978-1-4244-8110-1
  • Electronic_ISBN
    978-1-4244-8111-8
  • Type

    conf

  • DOI
    10.1109/MMSP.2010.5662027
  • Filename
    5662027
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3493962