• DocumentCode
    1012051
  • Title

    Graph covering index assignment in vector quantisation for noisy channels

  • Author

    Potter, Lee C.

  • Volume
    31
  • Issue
    18
  • fYear
    1995
  • fDate
    8/31/1995 12:00:00 AM
  • Firstpage
    1550
  • Lastpage
    1552
  • Abstract
    An index assignment algorithm is presented for vector quantisation coding on noisy channels. The graph covering heuristic requires an enumeration of hypercube connections, for which a constructive procedure is provided. Experimental results for Gauss-Markov sources show that the proposed method provides more reduction in channel distortion than existing techniques
  • Keywords
    channel coding; graph theory; hypercube networks; vector quantisation; Gauss-Markov sources; channel distortion; graph; heuristic algorithm; hypercube connections; index assignment; noisy channels; vector quantisation coding;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19951079
  • Filename
    469178
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1012051