Critical Lengths of Error Events in Convolutional Codes

Jørn Justesen, Jakob Dahl Andersen

    Research output: Book/ReportReport

    Abstract

    If the calculation of the critical length is based on the expurgated exponent, the length becomes nonzero for low error probabilitites. This result applies to typical long codes, but it may also be useful for modelling error events in specific codes
    Original languageEnglish
    Number of pages14
    Publication statusPublished - 1996
    Event1994 IEEE International Symposium on Information Theory - Trondheim, Norway
    Duration: 27 Jun 19941 Jul 1994
    http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3149

    Conference

    Conference1994 IEEE International Symposium on Information Theory
    CountryNorway
    CityTrondheim
    Period27/06/199401/07/1994
    Internet address

    Cite this