The Art of Error Correcting Coding phần 10 potx

Montorsi, “Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes,” IEEE Trans.. Sorger, “Modified Generalized Concatenated Codes and Their Appli-cation to the Const

WEIGHT DISTRIBUTIONS OF EXTENDED BCH CODES 237

238 WEIGHT DISTRIBUTIONS OF EXTENDED BCH CODES

WEIGHT DISTRIBUTIONS OF EXTENDED BCH CODES 239

240 WEIGHT DISTRIBUTIONS OF EXTENDED BCH CODES

WEIGHT DISTRIBUTIONS OF EXTENDED BCH CODES 241

242 WEIGHT DISTRIBUTIONS OF EXTENDED BCH CODES

WEIGHT DISTRIBUTIONS OF EXTENDED BCH CODES 243

244 WEIGHT DISTRIBUTIONS OF EXTENDED BCH CODES

WEIGHT DISTRIBUTIONS OF EXTENDED BCH CODES 245

L R Bahl, J Cocke, F Jelinek and J Raviv, “Optimal Decoding of Linear Codes for Minimizing

Symbol Error Rate,” IEEE Trans Inf Theory, vol IT-20, pp 284–287, Mar 1974.

A S Barbulescu and S S Pietrobon, “Interleaver Design for Turbo Codes,” Electron Lett., vol 30,

no 25, pp 2107–2108, Dec 1994

G Battail, “A Conceptual Framework for Understanding Turbo Codes,” IEEE J Sel Areas Commun.,

vol 16, no 2, pp 245–254, Feb 1998

S Benedetto and E Biglieri, Principles of Digital Transmission, Kluwer Academic/Plenum Publishers,

1999

S Benedetto, D Divsalar, G Montorsi and F Pollara, “Parallel Concatenated Trellis Coded

Mod-ulation,” Proceedings of the 1996 IEEE International Conference on Communications (ICC’96),

pp 974–978, Dallas, Texas, 1996

S Benedetto, D Divsalar, G Montorsi and F Pollara, “Serial Concatenation of Interleaved Codes:

Performance Analysis, Design, and Iterative Decoding,” IEEE Trans Inf Theory, vol 44, no 3,

pp 909–926, May 1998

S Benedetto and G Montorsi, “Unveiling Turbo Codes: Some Results on Parallel Concatenated

Coding Schemes,” IEEE Trans Inf Theory, vol 42, no 2, pp 409–428, Mar 1996.

E R Berlekamp, Algebraic Coding Theory, rev ed., Aegean Park Press, 1984.

E R Berlekamp, “Bounded Distance + 1 Soft-Decision Reed-Solomon Decoding,” IEEE Trans Inf.

Theory, vol 42, no 3, pp 704–720, May 1996.

C Berrou and A Glavieux, “Near Optimum Error Correcting Coding and Decoding,” IEEE Trans.

Commun., vol 44, no 10, pp 1261–1271, Oct 1996.

C Berrou and A Glavieux, “Reflections on the Prize Paper: ‘Near Optimum Error-Correcting Coding

and Decoding: Turbo Codes’,” IEEE Inf Theory Soc News, vol 48, no 2, pp 24–31, June 1998.

C Berrou, A Glavieux and P Thitimajshima, “Near Shannon Limit Error-Correcting Coding and

Decoding: Turbo-Codes,” Proceedings of the 1993 IEEE International Conference on

Communica-tions (ICC’93), pp 1064–1070, Geneve, Switzerland, May 1993.

E Biglieri, D Divsalar, P J McLane and M K Simon, Introduction to Trellis-Coded Modulation

with Applications, Macmillan Publishing, 1991.

R E Blahut, Theory and Practice of Error Control Codes, Addison-Wesley, 1984.

M Blaum, “A Family of Efficient Burst-Correcting Array Codes,” IEEE Trans Inf Theory, vol 36,

no 3, pp 671–675, May 1990

E L Blokh and V V Zyablov, “Coding of Generalized Concatenated Codes,” Probl Pered Inform.,

vol 10, no 1, pp 45–50, 1974

The Art of Error Correcting Coding, Second Edition Robert H Morelos-Zaragoza

 2006 John Wiley & Sons, Ltd ISBN: 0-470-01558-6

248 BIBLIOGRAPHY

M Boo, F Arguello, J D Bruguera, R Doallo and E L Zapata, “High-Performance VLSI

Archi-tecture for the Viterbi Algorithm,” IEEE Trans Commun., vol 45, no 2, pp 168–176, Feb.

1997

M Bossert, Channel Coding for Telecommunications, John Wiley & Sons, 1999.

M Breiling and J B Huber, “Combinatorial Analysis of the Minimum Distance of Turbo Codes,”

IEEE Trans Inf Theory, vol 47, no 7, pp 2737–2750, Nov 2001.

A E Brouwer and T Verhoeff, “An Updated Table of Minimum-Distance Bounds for Binary Linear

Codes,” IEEE Trans Inf Theory, vol 39, no 2, pp 662–677, Mar 1993.

H O Burton and E J Weldon, Jr., “Cyclic Product Codes,” IEEE Trans Inf Theory, vol IT-11, no.

G Caire, G Taricco and E Biglieri, “Bit-Interleaver Coded Modulation,” IEEE Trans Inf Theory,

vol 44, no 3, pp 927–946, May 1998

F Carden, M D Ross, B T Kopp and W P Osborn, “Fast TCM Decoding: Phase Quantization

and Integer Weighting,” IEEE Trans Commun., vol 42, no 4, pp 808–812, Apr 1994.

C.-C Chao and Y.-L Yao, “Hidden Markov Models for the Burst Error Statistics of Viterbi Decoding,”

IEEE Trans Commun., vol 44, no 12, pp 1620–1622, Dec 1996.

D Chase, “A Class of Algorithms for Decoding Block Codes with Channel Measurement

Informa-tion,” IEEE Trans Inf Theory, vol IT-18, pp 170–182, 1972.

P Chaudhari and A K Khandani, “Using the Fourier Transform to Compute the Weight Distribution

of a Binary Linear Block Code,” IEEE Commun Lett., vol 5, no 1, pp 22–24, Jan 2001.

S.-Y Chung, G D Forney, Jr., T J Richardson and R Urbanke, “On the Design of Low-Density

Parity-Check Codes within 0.0045 dB of the Shannon Limit,” IEEE Commun Lett., vol 5, no 2,

pp 58–60, Feb 2001

G Clark and J Cain, Error-Correction Coding for Digital Communications, Plenum Press, 1981.

O M Collins, “The Subtleties and Intricacies of Building a Constraint Length 15 Convolutional

Decoder,” IEEE Trans Commun., vol 40, no 12, pp 1810–1819, Nov 1992.

T M Cover and J A Thomas, Elements of Information Theory, John Wiley & Sons, 1991.

Y Desaki, T Fujiwara and T Kasami, “A Method for Computing the Weight Distribution of a Block

Code by Using Its Trellis Diagram,” IEICE Trans Fundamentals, vol E77-A, pp 1230–1237,

Aug 1994

Y Desaki, T Fujiwara and T Kasami, “The Weight Distribution of Extended Binary Primitive BCH

Codes of Length 128,” IEEE Trans Inf Theory, vol 43, no 4, pp 1364–1371, July 1997.

U Dettmar, G Yan and U K Sorger, “Modified Generalized Concatenated Codes and Their

Appli-cation to the Construction and Decoding of LUEP Codes,” IEEE Trans Inf Theory, vol 41, no.

5, pp 1499–1503, Sept 1995

A Dholakia, Introduction to Convolutional Codes With Applications, Kluwer, 1994.

D Divsalar, S Dolinar and F Pollara, “Iterative Turbo Decoder Analysis Based on Density

Evolu-tion,” IEEE J Sel Areas Commun., vol 19, no 5, pp 891–907, May 2001.

D Divsalar, H Jin and R J McEliece, “Coding Theorems for Turbo-Like Codes,” Proceedings of the

1998 Allerton Conference on Communications, Control, and Computing, pp 210–219, University

of Illinois, Urbana-Champaign, IL, 1998

BIBLIOGRAPHY 249

D Divsalar and F Pollara, “Turbo Codes for PCS Applications,” Proceedings of the 1993 IEEE

International Conference on Communications (ICC’93), pp 1064–1070, Geneva, Switzerland, May

1993

D Divsalar and F Pollara, “Turbo Codes for Deep-Space Communications,” JPL TDA Progress

Report 42-120, NASA Jet Propulsion Laboratory, pp 29–39, Feb 1995.

H El Gamal and A R Hammons, Jr., “Analyzing the Turbo Decoder Using the Gaussian

Approxi-mation,” IEEE Trans Inf Theory, vol 47, no 2, pp 671–686, Feb 2001.

P Elias, “Error-Free Coding,” IRE Trans., vol PGIT-4, pp 29–37, 1954.

P Elias, “Coding for Noisy Channels,” IRE Conv Rec., vol 3, pt 4, pp 37–46, 1955; Also in E R Berlekamp, ed., Key Papers in the Development of Coding Theory, pp 48–55, IEEE Press, 1974.

P Elias, “Error-Correcting Codes for List Decoding,” IEEE Trans Inf Theory, vol 37, no 1, pp.

5–12, Jan 1991

EN 310 210, ETSI, “Digital Video Broadcasting (DVB): Framing Structure, Channel Coding andModulation for Digital Satellite News Gathering (DSNG) and Other Contribution Applications bySatellite,” Mar 1997

W Feng and B Vucetic, “A List Bidirectional Soft Output Decoder of Turbo Codes,” Proceedings

of the International Symposium on Turbo Codes and Related Topics, pp 288–292, Brest, France,

Sept 3-5, 1997

G D Forney, Jr., Concatenated Codes, Research Monograph 37, MIT Press, 1966a.

G D Forney, “Generalized Minimum Distance Decoding,” IEEE Trans Inf Theory, vol IT-12, pp.

125–131, April 1966b

G D Forney, “Convolutional Codes I: Algebraic Structure,” IEEE Trans Inf Theory, vol IT-16, no.

6, pp 720–738, Nov 1970

G D Forney, Jr., “Burst Correcting Codes for the Classic Bursty Channel,” IEEE Trans Commun.

Technol., vol COM-19, pp 772–281, 1971.

G D Forney, Jr., “On Decoding BCH Codes,” IEEE Trans Inf Theory, vol IT-11, pp 393–403, Oct 1965; Also in E R Berlekamp, ed., Key Papers in the Development of Coding Theory, pp.

149–155, IEEE Press, 1974

G D Forney, Jr., “Coset Codes II: Binary Lattices and Related Codes,” IEEE Trans Inf Theory,

vol 24, no 5, pp 1152–1187, Sept 1988

G D Forney and G Ungerboeck, “Modulation and Coding for Linear Gaussian Channels,” IEEE

Trans Inf Theory, Special Commemorative Issue, vol 44, no 6, pp 2384–2415, Oct 1998.

G D Forney, “Codes on Graphs: Normal Realizations,” IEEE Trans Inf Theory, vol 47, no 2, pp.

520–548, Feb 2001

M P C Fossorier, F Burkert, S Lin and J Hagenauer, “On the Equivalence Between SOVA and

Max-Log-MAP Decodings,” IEEE Commun Lett., vol 2, no 5, pp 137–139, May 1998.

M P C Fossorier and S Lin, “Soft-Decision Decoding on Linear Block Codes Based on Ordered

Statistics,” IEEE Trans Inf Theory, vol 41, no 5, pp 1379–1396, Sept 1995.

M P C Fossorier and S Lin, “Some Decomposable Codes: The|a + x|b + x|a + b + x| tion,” IEEE Trans Inf Theory, vol 43, no 5, pp 1663–1667, Sept 1997a.

Construc-M P C Fossorier and S Lin, “Complementary Reliability-Based Soft-Decision Decoding of Linear

Block Codes Based on Ordered Statistics,” IEEE Trans Inf Theory, vol 42, no 5, pp 1667–1672,

Sep 1997b

M P C Fossorier and S Lin, “Soft-Input Soft-Output Decoding of Linear Block Codes Based

on Ordered Statistics,” Proceedings of the 1998 IEEE Global Telecommunications Conference

(GLOBECOM’98), pp 2828–2833, Sydney, Australia, Nov 1998.

M P C Fossorier and S Lin, “Differential Trellis Decoding of Convolutional Codes,” IEEE Trans.

Inf Theory, vol 46, no 3, pp 1046–1053, May 2000.

250 BIBLIOGRAPHY

M P C Fossorier, S Lin and D J Costello, Jr., “On the Weight Distribution of Terminated

Convo-lutional Codes,” IEEE Trans Inf Theory, vol 45, no 5, pp 1646–1648, July 1999.

M P C Fossorier, S Lin and D Rhee, “Bit-Error Probability for Maximum-Likelihood Decoding

of Linear Block Codes and Related Soft-Decision Decoding Methods,” IEEE Trans Inf Theory,

vol 44, no 7, pp 3083–3090, Nov 1998

M P C Fossorier, M Mihaljevi´c and H Imai, “Reduced Complexity Iterative Decoding of

Low-Density Parity Check Codes Based on Belief Propagation,” IEEE Trans Commun., vol 47, no 5,

pp 673–680, May 1999

B J Frey and F R Kschischang, “Early Detection and Trellis Splicing: Reduced-Complexity Iterative

Decoding,” IEEE J Sel Areas Commun., vol 16, no 2, pp 153–159, Feb 1998.

T Fujiwara, T Kasami, A Kitai and S Lin, “On the Undetected Error Probability of Shortened

Hamming Codes,” IEEE Trans Commun., vol COM-33, pp 570–574, June 1985.

R G Gallager, “Low-Density Parity-Check Codes,” IRE Trans Inf Theory, vol 8, no 1, pp 21–28,

Jan 1962

R Garello, P Perleoni and S Benedetto, “Computing the Free Distance of Turbo Codes and Serially

Concatenated Codes with Interleavers: Algorithms and Applications,” IEEE J Sel Areas Commun.,

vol 19, no 5, pp 800–812, May 2001

M J E Golay, “Notes on Digital Coding” Proc IRE, vol 37, p 657, June 1949; Also in E R Berlekamp, ed., Key Papers in the Development of Coding Theory, p 13, IEEE Press, 1974.

J D Goli´c, “Iterative Optimum Symbol-by-Symbol Decoding and Fast Correlation Attacks,” IEEE

Trans Inf Theory, vol 47, no 7, pp 3040–3049, Nov 2001.

D Gorenstein and N Zierler, “A Class of Error Correcting Codes in p m Symbols,” J SIAM, vol 9,

pp 207–214, June 1961

V Guruswami and M Sudan, “Improved Decoding of Reed-Solomon and Algebraic-Geometry

Codes,” IEEE Trans Inf Theory, vol 45, no 6, pp 1757–1767, Sep 1999.

J Hagenauer, “Rate-Compatible Punctured Convolutional Codes (RCPC Codes) and their

Applica-tions,” IEEE Trans Commun., vol 36, no 4, pp 389–400, April 1988.

J Hagenauer and P Hoeher, “A Viterbi Algorithm with Soft-Decision Outputs and Its

Applica-tions,” Proceedings of the 1989 IEEE Global Telecommunications Conference (GLOBECOM’89),

pp 47.1.1–47.1.7, Dallas, Texas, 1989

J Hagenauer, E Offer and L Papke, “Iterative Decoding of Binary Block and Convolutional Codes,”

IEEE Trans Inf Theory, vol 42, no 2, pp 429–445, Mar 1996.

E K Hall and S G Wilson, “Stream-Oriented Turbo Codes,” IEEE Trans Inf Theory, vol 47, no.

5, pp 1813–1831, July 2001

R W Hamming, “Error Detecting and Error Correcting Codes,” Bell Syst Tech J., vol 29, pp 147–160, 1950; Also in E R Berlekamp, ed., Key Papers in the Development of Coding Theory,

pp 9–12, IEEE Press, 1974

S Haykin, Digital Communications, 4th ed., John Wiley and Sons, 2001.

C Heegard and S B Wicker, Turbo Coding, Kluwer Academic Press, 1999.

A P Hekstra, “An Alternative to Metric Rescaling in Viterbi Decoder,” IEEE Trans Commun., vol.

37, no 11, pp 1220–1222, Nov 1989

I N Herstein, Topics in Algebra, 2nd ed., John Wiley and Sons, 1975.

J Hokfelt, O Edfors and T Maseng, “A Turbo Code Interleaver Design Criterion Based on the

Performance of Iterative Decoding,” IEEE Commun Lett., vol 5, no 2, pp 52–54, Feb 2001.

B Honay and G S Markarian, Trellis Decoding of Block Codes: A Practical Approach, Kluwer,

1996

B Honary, G S Markarian and P G Farell, “Generalised Array Codes and Their Trellis Structure,”

Electron Lett., vol 28, no 6, pp 541–542, Mar 1993.

BIBLIOGRAPHY 251

M Y Hsiao, “A Class of Optimal Minimum Odd-Weight-Column SEC-DED Codes,” IBM J Res.

Dev., vol 14, July 1970.

H Imai and S Hirakawa, “A New Multilevel Coding Method Using Error-Correcting Codes,” IEEE

Trans Inf Theory, vol IT-23, no 3, pp 371–377, May 1977.

M Isaka, M P C Fossorier, R H Morelos-Zaragoza, S Lin and H Imai, “Multilevel Coded lation for Unequal Error Protection and Multistage Decoding Part II: Asymmetric Constellations,”

Modu-IEEE Trans Commun., vol 48, no 5, pp 774–784, May 2000.

Ecole Nationale Superieure des Telecommunications de Bretagne, Proceedings of the International

Symposium on Turbo Codes and Related Topics, Brest, France, September 3–5, 1997.

Ecole Nationale Superieure des Telecommunications de Bretagne, Proceedings of the Second

Inter-national Symposium on Turbo Codes and Related Topics, Brest, France, September 4–7, 2000.

Institute of Electrical and Electronics Engineers, Inc., “Special Issue on Codes and Graphs and Iterative

Decoding Algorithms,” IEEE Trans Inf Theory, vol 47, no 2, Feb 2001.

M C Jeruchim, P Balaban and K S Shanmugan, Simulation of Communication Systems, Plenum

Press, 1992

R Johannesson and K S Zigangirov, Fundamentals of Convolutional Coding, IEEE Press, 1999.

Institute of Electrical and Electronics Engineers, Inc., “Special Issue on the Turbo Principle: from

Theory to Practice,” Part I, IEEE J Sel Areas Commun., vol 19, no 5, May 2001.

Institute of Electrical and Electronics Engineers, Inc., “Special Issue on the Turbo Principle: from

Theory to Practice,” Part II, IEEE J Sel Areas Commun., vol 19, no 9, Sept 2001.

N Kamiya, “On Algebraic Soft-Decision Decoding Algorithms for BCH Codes,” IEEE Trans Inf.

Theory, vol 47, no 1, pp 45–58, Jan 2001.

T Kaneko, T Nishijima, H Inazumi and S Hirasawa, “An Efficient Maximum-Likelihood Decoding

Algorithm for Linear Block Codes with Algebraic Decoder,” IEEE Trans Inf Theory, vol 40, no.

2, pp 320–327, Mar 1994

M Kasahara, Y Sugiyama, S Hirasawa and T Namekawa, “A New Class of Binary Codes

Con-structed on the Basis of BCH Codes,” IEEE Trans Inf Theory, vol IT-21, pp 582–585, 1975.

M Kasahara, Y Sugiyama, S Hirasawa and T Namekawa, “New Classes of Binary Codes

Con-structed on the Basis of Concatenated and Product Codes,” IEEE Trans Inf Theory, vol IT-22,

no 4, pp 462–468, July 1976

T Kasami, “A Decoding Procedure for Multiple-Error-Correcting Cyclic Codes,” IEEE Trans Inf.

Theory, vol IT-10, pp 134–138, 1964.

T Kasami, T Koumoto, T Takata, T Fujiwara and S Lin, “The Least Stringent Sufficient

Con-dition on the Optimality of Suboptimally Decoded Codewords,” Proceedings of the 1995 IEEE

International Symposium on Information Theory (ISIT’95), p 470, Whistler, Canada, 1995.

T Kasami, S Lin and W W Peterson, “Polynomial Codes,” IEEE Trans Inf Theory, vol IT-14,

no 6, pp 807–814, Nov 1968

P Kazakov, “Fast Calculation of the Number of Minimum-Weight Words of CRC Codes,” IEEE

Trans Inf Theory, vol 47, no 3, pp 1190–1195, March 2001.

R Koetter and A Vardy, “Algebraic Soft-Decision Decoding of Reed-Somon Codes,” Proceedings

of the 2000 IEEE International Symposium on Information Theory (ISIT’00), p 61, Sorrento, Italy,

June 25–30, 2000

R R Kschischang, B J Frey and H.-A Loeliger, “Factor Graphs and the Sum-Product Algorithm,”

IEEE Trans Inf Theory, vol 47, no 2, pp 498–519, Feb 2001.

Y Kuo, S Lin and M P C Fossorier, “Low-Density Parity-Check Codes Based on Finite Geometries:

A Rediscovery and New Results,” IEEE Trans Inf Theory, vol 47, no 7, pp 2711–2736, Nov.

2001

L H C Lee, Convolutional Coding: Fundamentals and Applications, Artech House, 1997.