• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History

عنوان
Performance analysis of linear codes under maximum-likelihood decoding :

پدید آورنده
Igal Sason, Shlomo Shamai.

موضوع
Coding theory.,Decoders (Electronics),Error-correcting codes (Information theory),Coding theory.,COMPUTERS-- Information Theory.,Decoders (Electronics),Error-correcting codes (Information theory),TECHNOLOGY & ENGINEERING-- Signals & Signal Processing.

رده
TK5102
.
96
.
S27
2006

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

(Number (ISBN
1282823175
(Number (ISBN
1933019794
(Number (ISBN
9781282823174
(Number (ISBN
9781933019796
Erroneous ISBN
1933019328

NATIONAL BIBLIOGRAPHY NUMBER

Number
b770860

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Performance analysis of linear codes under maximum-likelihood decoding :
General Material Designation
[Book]
Other Title Information
a tutorial /
First Statement of Responsibility
Igal Sason, Shlomo Shamai.

.PUBLICATION, DISTRIBUTION, ETC

Place of Publication, Distribution, etc.
Boston :
Name of Publisher, Distributor, etc.
Now Publishers,
Date of Publication, Distribution, etc.
©2006.

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
1 online resource (ix, 222 pages) :
Other Physical Details
illustrations

SERIES

Series Title
Foundations and trends in communications and information theory,
Volume Designation
v. 3, issue 1/2
ISSN of Series
1567-2328 ;

GENERAL NOTES

Text of Note
"Originally published as Foundations and trends in communications and information technology [sic] volume 3, issues 1 and 2"--Page 4 of cover.
Text of Note
Title from PDF title page (viewed July 10, 2008).

INTERNAL BIBLIOGRAPHIES/INDEXES NOTE

Text of Note
Includes bibliographical references (pages 206-222).

CONTENTS NOTE

Text of Note
Cover -- Contents -- A Short Overview -- Introduction -- General approach for the derivation of improved upper bounds -- On Gallager bounds: Variations and applications -- Lower bounds on the decoding error probability -- Union Bounds: How Tight Can They Be? -- Union bounds -- Union bounds for turbo-like codes -- Improved Upper Bounds for Gaussian and Fading Channels -- The methodology of the bounding technique -- Improved upper bounds for the Gaussian channel -- Improved upper bounds for fading channels -- Concluding comments -- Gallager-Type Upper Bounds: Variations, Connections and Applications -- Introduction -- Gallager bounds for symmetric memoryless channels -- Interconnections between bounds -- Special cases of the DS2 bound -- Gallager-type bounds for the mismatched decoding regime -- Gallager-type bounds for parallel channels -- Some applications of the Gallager-type bounds -- Summary and conclusions -- Sphere-Packing Bounds on the Decoding Error Probability -- Introduction -- The 1959 Shannon lower bound for theAWGN channel -- The 1967 sphere-packing bound -- Sphere-packing bounds revisited for moderate block lengths -- Concluding comments -- Lower Bounds Based on de Caen's Inequality and Recent Improvements -- Introduction -- Lower bounds based on de Caen's inequality and variations -- Summary and conclusions -- Concluding Remarks -- Acknowledgments -- References.
0

SUMMARY OR ABSTRACT

Text of Note
This article is focused on the performance evaluation of linear codes under optimal maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively complex for most practical codes, their performance analysis under ML decoding allows to predict their performance without resorting to computer simulations. It also provides a benchmark for testing the sub-optimality of iterative (or other practical) decoding algorithms. This analysis also establishes the goodness of linear codes (or ensembles), determined by the gap between their achievable rates under optimal ML decoding and information theoretical limits. In this article, upper and lower bounds on the error probability of linear codes under ML decoding are surveyed and applied to codes and ensembles of codes on graphs. For upper bounds, we discuss various bounds where focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen's based bounds and their improvements, and also consider sphere-packing bounds with their recent improvements targeting codes of moderate block lengths.

ACQUISITION INFORMATION NOTE

Source for Acquisition/Subscription Address
01251032

OTHER EDITION IN ANOTHER MEDIUM

Title
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding : A Tutorial.
International Standard Book Number
9781933019321

TOPICAL NAME USED AS SUBJECT

Coding theory.
Decoders (Electronics)
Error-correcting codes (Information theory)
Coding theory.
COMPUTERS-- Information Theory.
Decoders (Electronics)
Error-correcting codes (Information theory)
TECHNOLOGY & ENGINEERING-- Signals & Signal Processing.

(SUBJECT CATEGORY (Provisional

COM-- 031000
TEC-- 067000
TJK

DEWEY DECIMAL CLASSIFICATION

Number
621
.
382/2
Edition
22

LIBRARY OF CONGRESS CLASSIFICATION

Class number
TK5102
.
96
Book number
.
S27
2006

PERSONAL NAME - PRIMARY RESPONSIBILITY

Sason, Igal.

PERSONAL NAME - ALTERNATIVE RESPONSIBILITY

Shamai, Shlomo,1958-

ORIGINATING SOURCE

Date of Transaction
20201206165657.0
Cataloguing Rules (Descriptive Conventions))
pn

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival