• DocumentCode
    3067644
  • Title

    On the pseudocodeword redundancy

  • Author

    Zumbragel, Jens ; Flanagan, Mark F. ; Skachek, Vitaly

  • Author_Institution
    Claude Shannon Inst., Univ. Coll. Dublin, Dublin, Ireland
  • fYear
    2010
  • fDate
    13-18 June 2010
  • Firstpage
    759
  • Lastpage
    763
  • Abstract
    We define the AWGNC, BSC, and max-fractional pseudocodeword redundancy p(C) of a code C as the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of C. We show that most codes do not have a finite p(C). We also provide bounds on the pseudocodeword redundancy for some families of codes, including codes based on designs.
  • Keywords
    AWGN channels; channel coding; matrix algebra; AWGNC; BSC; Hamming distance; additive white Gaussian noise channel; binary symmetric channel; max-fractional pseudocodeword redundancy; parity-check matrix; Additive white noise; Educational institutions; Euclidean distance; Hamming distance; Linear code; Maximum likelihood decoding; Parity check codes; Redundancy; Sparse matrices; Symmetric matrices;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
  • Conference_Location
    Austin, TX
  • Print_ISBN
    978-1-4244-7890-3
  • Electronic_ISBN
    978-1-4244-7891-0
  • Type

    conf

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