ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Collection
Keywords
Years
  • 1
    facet.materialart.
    Unknown
    Generalized minimum distance decoding. (1966)
    In:  Other Sources
    Details
    Publication Date: 2019-05-30
    Description: Generalized minimum distance decoding that permits likelihood information to be used, yielding same probability of error as maximum likelihood decoding
    Keywords: COMMUNICATIONS
    Type: /INST. OF ELECTRICAL AND ELECTRONICS ENGINEERS
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 2
    facet.materialart.
    Unknown
    Concatenated codes Technical report 440 (1965)
    In:  CASI
    Details
    Publication Date: 2019-05-29
    Description: Concatenation method for decoding of complex short codes
    Keywords: COMPUTERS
    Type: NASA-CR-71160
    Format: application/pdf
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 3
    facet.materialart.
    Unknown
    On decoding BCH codes. (1965)
    In:  Other Sources
    Details
    Publication Date: 2019-05-30
    Description: Extension, modification and analysis of Gorenstein-Zierler decoding algorithm for binary codes of Bose, Ray-Chaudhuri and Hocquenghem /BCH/ correcting erasures and errors
    Keywords: COMPUTERS
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 4
    facet.materialart.
    Unknown
    Convolutional codes. II - Maximum-likelihood decoding. III - Sequential decoding (1974)
    In:  Other Sources
    Details
    Publication Date: 2019-06-27
    Description: Maximum-likelihood decoding is characterized as the determination of the shortest path through a topological structure called a trellis. Aspects of code structure are discussed along with questions regarding maximum-likelihood decoding on memoryless channels. A general bounding technique is introduced. The technique is used to obtain asymptotic bounds on the probability of error for maximum-likelihood decoding and list-of-2 decoding. The basic features of sequential algorithms are discussed along with a stack algorithm, questions of computational distribution, and the martingale approach to computational bounds.
    Keywords: COMPUTERS
    Type: Information and Control; 25; July 197
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...