top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
2009 15th IEEE International on-Line Testing Symposium
2009 15th IEEE International on-Line Testing Symposium
Pubbl/distr/stampa [Place of publication not identified], : IEEE, 2009
Descrizione fisica 1 online resource
Disciplina 621.381548
Soggetto topico Electronic circuits - Testing - Data processing
Error-correcting codes (Information theory)
ISBN 9781424448227
1424448220
9781424445950
1424445957
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910140043303321
[Place of publication not identified], : IEEE, 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
2017 IEEE 23rd International Symposium on On-Line Testing and Robust System Design (IOLTS) / / Institute of Electrical and Electronics Engineers ; Panepistēmio Athēnōn, contributor
2017 IEEE 23rd International Symposium on On-Line Testing and Robust System Design (IOLTS) / / Institute of Electrical and Electronics Engineers ; Panepistēmio Athēnōn, contributor
Pubbl/distr/stampa Piscataway, N.J. : , : IEEE, , 2017
Descrizione fisica 1 online resource : illustrations
Disciplina 621.3815
Soggetto topico Electronic circuit design
Error-correcting codes (Information theory)
ISBN 1-5386-0352-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Altri titoli varianti 2017 IEEE 23rd International Symposium on On-Line Testing and Robust System Design
Record Nr. UNISA-996280327703316
Piscataway, N.J. : , : IEEE, , 2017
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
2017 IEEE 23rd International Symposium on On-Line Testing and Robust System Design (IOLTS) / / Institute of Electrical and Electronics Engineers ; Panepistēmio Athēnōn, contributor
2017 IEEE 23rd International Symposium on On-Line Testing and Robust System Design (IOLTS) / / Institute of Electrical and Electronics Engineers ; Panepistēmio Athēnōn, contributor
Pubbl/distr/stampa Piscataway, N.J. : , : IEEE, , 2017
Descrizione fisica 1 online resource : illustrations
Disciplina 621.3815
Soggetto topico Electronic circuit design
Error-correcting codes (Information theory)
ISBN 1-5386-0352-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Altri titoli varianti 2017 IEEE 23rd International Symposium on On-Line Testing and Robust System Design
Record Nr. UNINA-9910219879603321
Piscataway, N.J. : , : IEEE, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
2018 IEEE 24th International Symposium on On-Line Testing And Robust System Design : 2-4 July 2018, Platja d'Aro, Spain / / Institute of Electrical and Electronics Engineers
2018 IEEE 24th International Symposium on On-Line Testing And Robust System Design : 2-4 July 2018, Platja d'Aro, Spain / / Institute of Electrical and Electronics Engineers
Pubbl/distr/stampa Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2018
Descrizione fisica 1 online resource (78 pages)
Disciplina 005.72
Soggetto topico Error-correcting codes (Information theory)
Electronic circuit design
Online data processing
ISBN 1-5386-5992-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996280092703316
Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2018
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
2018 IEEE 24th International Symposium on On-Line Testing And Robust System Design : 2-4 July 2018, Platja d'Aro, Spain / / Institute of Electrical and Electronics Engineers
2018 IEEE 24th International Symposium on On-Line Testing And Robust System Design : 2-4 July 2018, Platja d'Aro, Spain / / Institute of Electrical and Electronics Engineers
Pubbl/distr/stampa Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2018
Descrizione fisica 1 online resource (78 pages)
Disciplina 005.72
Soggetto topico Error-correcting codes (Information theory)
Electronic circuit design
Online data processing
ISBN 1-5386-5992-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910287958003321
Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Applied algebra, algebraic algorithms and error-correcting codes : 18th international conference, AAECC-18, Tarragona, Spain, June 8-12, 2009. proceedings / / Maria Bras-Amoros, Tom Hoholdt (Eds.)
Applied algebra, algebraic algorithms and error-correcting codes : 18th international conference, AAECC-18, Tarragona, Spain, June 8-12, 2009. proceedings / / Maria Bras-Amoros, Tom Hoholdt (Eds.)
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin ; ; Heidelberg, : Springer-Verlag, 2009
Descrizione fisica 1 online resource (IX, 243 p.)
Disciplina 005.72
Altri autori (Persone) Bras-AmarosMaria
HoholdtTom
Collana Lecture notes in computer science
Soggetto topico Error-correcting codes (Information theory)
Algebra - Data processing
Algorithms
ISBN 3-642-02181-6
Classificazione DAT 465f
DAT 584f
DAT 702f
MAT 110f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Codes -- The Order Bound for Toric Codes -- An Extension of the Order Bound for AG Codes -- Sparse Numerical Semigroups -- From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamp–Massey Algorithm -- Rank for Some Families of Quaternary Reed-Muller Codes -- Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes -- Simulation of the Sum-Product Algorithm Using Stratified Sampling -- A Systems Theory Approach to Periodically Time-Varying Convolutional Codes by Means of Their Invariant Equivalent -- On Elliptic Convolutional Goppa Codes -- The Minimum Hamming Distance of Cyclic Codes of Length 2p s -- There Are Not Non-obvious Cyclic Affine-invariant Codes -- On Self-dual Codes over Z 16 -- Cryptography -- A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications -- Word Oriented Cascade Jump ??LFSR -- On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling -- Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions -- Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE -- Algebra -- Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields -- New Commutative Semifields and Their Nuclei -- Spreads in Projective Hjelmslev Geometries -- On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings -- Rooted Trees Searching for Cocyclic Hadamard Matrices over D 4t -- Extended Abstracts -- Interesting Examples on Maximal Irreducible Goppa Codes -- Repeated Root Cyclic and Negacyclic Codes over Galois Rings -- Construction of Additive Reed-Muller Codes -- Gröbner Representations of Binary Matroids -- A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product -- Novel Efficient Certificateless Aggregate Signatures -- Bounds on the Number of Users for Random 2-Secure Codes.
Record Nr. UNINA-9910484968703321
Berlin ; ; Heidelberg, : Springer-Verlag, 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Applied algebra, algebraic algorithms and error-correcting codes : 16th international symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006 : proceedings / / Marc Fossorier ... [et al.] (eds.)
Applied algebra, algebraic algorithms and error-correcting codes : 16th international symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006 : proceedings / / Marc Fossorier ... [et al.] (eds.)
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin ; ; New York, : Springer, c2006
Descrizione fisica 1 online resource (XII, 344 p.)
Disciplina 005.72
Altri autori (Persone) FossorierMarc <1964->
Collana Lecture notes in computer science
Soggetto topico Error-correcting codes (Information theory)
Algebra - Data processing
Algorithms
ISBN 3-540-31424-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Bent and Highly Nonlinear Balanced/Resilient Functions and Their Algebraic Immunities -- On Generalized Parity Checks -- Cryptography Based on Bilinear Maps -- The Merit Factor Problem for Binary Sequences -- Quantum Period Reconstruction of Binary Sequences -- The Vector Key Equation and Multisequence Shift Register Synthesis -- A General Framework for Applying FGLM Techniques to Linear Codes -- A Theory of Highly Nonlinear Functions -- The Solutions of the Third Power Sum Equation for Niho Type Decimations -- On Constructing AG Codes Without Basis Functions for Riemann-Roch Spaces -- Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points -- A Class of Fermat Curves for which Weil-Serre’s Bound Can Be Improved -- Nonbinary Quantum Codes from Hermitian Curves -- A Genetic Algorithm for Cocyclic Hadamard Matrices -- Unconditionally Secure Chaffing-and-Winnowing: A Relationship Between Encryption and Authentication -- A Fast Calculus for the Linearizing Attack and Its Application to an Attack on KASUMI -- On Achieving Chosen Ciphertext Security with Decryption Errors -- Applying Fujisaki-Okamoto to Identity-Based Encryption -- A Short Random Fingerprinting Code Against a Small Number of Pirates -- A General Formulation of Algebraic and Fast Correlation Attacks Based on Dedicated Sample Decimation -- Traitor Tracing Against Powerful Attacks Using Combinatorial Designs -- New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems -- LDPC Codes for Fading Channels: Two Strategies -- Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping -- Algebraic Constructions of Quasi-cyclic LDPC Codes – Part I: For AWGN and Binary Random Erasure Channels -- Algebraic Construction of Quasi-cyclic LDPC Codes – Part II: For AWGN and Binary Random and Burst Erasure Channels -- New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels -- Long Extended BCH Codes Are Spanned by Minimum Weight Words -- On the Feng-Rao Bound for Generalized Hamming Weights -- Nested Codes for Constrained Memory and for Dirty Paper -- Complementary Sets and Reed-Muller Codes for Peak-to-Average Power Ratio Reduction in OFDM -- Hadamard Codes of Length 2 t s (s Odd). Rank and Kernel.
Altri titoli varianti AAECC-16
Record Nr. UNINA-9910483585003321
Berlin ; ; New York, : Springer, c2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Applied algebra, algebraic algorithms, and error-correcting codes : 13th international symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999 : proceedings / / Marc Fossorier [and three others], (editors)
Applied algebra, algebraic algorithms, and error-correcting codes : 13th international symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999 : proceedings / / Marc Fossorier [and three others], (editors)
Edizione [1st ed. 1999.]
Pubbl/distr/stampa Berlin : , : Springer, , [1999]
Descrizione fisica 1 online resource (XIV, 518 p.)
Disciplina 005.72
Collana Lecture notes in computer science
Soggetto topico Error-correcting codes (Information theory)
Algebra - Data processing
Algorithms
ISBN 3-540-46796-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Codes on Graphs: A Survey for Algebraists -- RA Codes Achieve AWGN Channel Capacity -- Monomial Ideals and Planar Graphs -- A Fast Program Generator of Fast Fourier Transforms -- On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms -- Curves with Many Points and Their Applications -- Codes and Iterative Decoding -- New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity -- On the Theory of Low-Density Convolutional Codes -- Combinatorics I: Arithmetic -- On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders -- A New Representation of Boolean Functions -- Combinatorics II: Graphs and Matrices -- An Algorithm to Compute a Nearest Point in the Lattice A n * -- Sequences from Cocycles -- Block Codes I -- On the Second Greedy Weight for Binary Linear Codes -- On the Size of Identifying Codes -- Algebra I: Rings and Fields -- Fast Quantum Fourier Transforms for a Class of Non-abelian Groups -- Linear Codes and Rings of Matrices -- On ?4-Simplex Codes and Their Gray Images -- Decoding Methods -- Some Results on Generalized Concatenation of Block Codes -- Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping -- An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity -- Algebra II -- Recursive MDS-Codes and Pseudogeometries -- Strength of ISTY1 without FL Function for Higher Order Differential Attack -- Code Construction -- Quantum Reed—Solomon Codes -- Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel -- Rectangular Codes and Rectangular Algebra -- Codes and Algebra I: Algebraic Curves -- Decoding Hermitian Codes with Sudan’s Algorithm -- Computing a Basis of on an affine algebraic curve with one rational place at infinit -- Cryptography -- Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications -- An Authentication Scheme over Non-authentic Public Channel in Information-Theoretic Secret-Key Agreement -- Codes and Decoding -- A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It -- Convolutional Codes -- Computing Weight Distributions of Convolutional Codes Via Shift Register Synthesis -- Properties of Finite Response Input Sequences of Recursive Convolutional Codes -- Combinatorics III: Designs -- Lower Bounds for Group Covering Designs -- Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices -- Decoding of Block Codes -- Double Circulant Self-Dual Codes Using Finite-Field Wavelet Transforms -- Algebra III: Rings and Fields -- Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey) -- Calculating Generators for Invariant Fields of Linear Algebraic Groups -- Constructing Elements of Large Order in Finite Fields -- Modulation and Codes -- New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy -- Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels -- Codes and Algebra II: Gröbner Bases and AG Codes -- A New Criterion for Normal Form Algorithms -- Discrete Fourier Transform and Gröbner Bases -- Block Codes II -- On the State Complexities of Ternary Codes -- Binary Optimal Linear Rate 1/2 Codes -- On Binary/Ternary Error-Correcting Codes with Minimum Distance 4 -- Algebra IV: Polynomials -- The Euclidean Algorithm and Primitive Polynomials over Finite Fields -- On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials -- Mastrovito Multiplier for General Irreducible Polynomials.
Record Nr. UNINA-9910143647503321
Berlin : , : Springer, , [1999]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Applied algebra, algebraic algorithms, and error-correcting codes : 13th international symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999 : proceedings / / Marc Fossorier [and three others], (editors)
Applied algebra, algebraic algorithms, and error-correcting codes : 13th international symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999 : proceedings / / Marc Fossorier [and three others], (editors)
Edizione [1st ed. 1999.]
Pubbl/distr/stampa Berlin : , : Springer, , [1999]
Descrizione fisica 1 online resource (XIV, 518 p.)
Disciplina 005.72
Collana Lecture notes in computer science
Soggetto topico Error-correcting codes (Information theory)
Algebra - Data processing
Algorithms
ISBN 3-540-46796-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Codes on Graphs: A Survey for Algebraists -- RA Codes Achieve AWGN Channel Capacity -- Monomial Ideals and Planar Graphs -- A Fast Program Generator of Fast Fourier Transforms -- On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms -- Curves with Many Points and Their Applications -- Codes and Iterative Decoding -- New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity -- On the Theory of Low-Density Convolutional Codes -- Combinatorics I: Arithmetic -- On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders -- A New Representation of Boolean Functions -- Combinatorics II: Graphs and Matrices -- An Algorithm to Compute a Nearest Point in the Lattice A n * -- Sequences from Cocycles -- Block Codes I -- On the Second Greedy Weight for Binary Linear Codes -- On the Size of Identifying Codes -- Algebra I: Rings and Fields -- Fast Quantum Fourier Transforms for a Class of Non-abelian Groups -- Linear Codes and Rings of Matrices -- On ?4-Simplex Codes and Their Gray Images -- Decoding Methods -- Some Results on Generalized Concatenation of Block Codes -- Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping -- An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity -- Algebra II -- Recursive MDS-Codes and Pseudogeometries -- Strength of ISTY1 without FL Function for Higher Order Differential Attack -- Code Construction -- Quantum Reed—Solomon Codes -- Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel -- Rectangular Codes and Rectangular Algebra -- Codes and Algebra I: Algebraic Curves -- Decoding Hermitian Codes with Sudan’s Algorithm -- Computing a Basis of on an affine algebraic curve with one rational place at infinit -- Cryptography -- Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications -- An Authentication Scheme over Non-authentic Public Channel in Information-Theoretic Secret-Key Agreement -- Codes and Decoding -- A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It -- Convolutional Codes -- Computing Weight Distributions of Convolutional Codes Via Shift Register Synthesis -- Properties of Finite Response Input Sequences of Recursive Convolutional Codes -- Combinatorics III: Designs -- Lower Bounds for Group Covering Designs -- Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices -- Decoding of Block Codes -- Double Circulant Self-Dual Codes Using Finite-Field Wavelet Transforms -- Algebra III: Rings and Fields -- Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey) -- Calculating Generators for Invariant Fields of Linear Algebraic Groups -- Constructing Elements of Large Order in Finite Fields -- Modulation and Codes -- New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy -- Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels -- Codes and Algebra II: Gröbner Bases and AG Codes -- A New Criterion for Normal Form Algorithms -- Discrete Fourier Transform and Gröbner Bases -- Block Codes II -- On the State Complexities of Ternary Codes -- Binary Optimal Linear Rate 1/2 Codes -- On Binary/Ternary Error-Correcting Codes with Minimum Distance 4 -- Algebra IV: Polynomials -- The Euclidean Algorithm and Primitive Polynomials over Finite Fields -- On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials -- Mastrovito Multiplier for General Irreducible Polynomials.
Record Nr. UNISA-996465671803316
Berlin : , : Springer, , [1999]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
The Art of Error Correcting Coding [[electronic resource]]
The Art of Error Correcting Coding [[electronic resource]]
Autore Morelos-Zaragoza Robert H
Edizione [2nd ed.]
Pubbl/distr/stampa Hoboken, : Wiley, 2006
Descrizione fisica 1 online resource (279 p.)
Disciplina 621.3822
621.38220151
Soggetto topico Computer algorithms
Error-correcting codes (Information theory)
Mathematics
Electrical & Computer Engineering
Telecommunications
Algebra
Engineering & Applied Sciences
Physical Sciences & Mathematics
Soggetto genere / forma Electronic books.
ISBN 1-280-51916-9
9786610519163
0-470-03570-6
0-470-03569-2
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The Art of Error Correcting Coding; Contents; Preface; Foreword; The ECC web site; 1 Introduction; 1.1 Error correcting coding: Basic concepts; 1.1.1 Block codes and convolutional codes; 1.1.2 Hamming distance, Hamming spheres and error correcting capability; 1.2 Linear block codes; 1.2.1 Generator and parity-check matrices; 1.2.2 The weight is the distance; 1.3 Encoding and decoding of linear block codes; 1.3.1 Encoding with G and H; 1.3.2 Standard array decoding; 1.3.3 Hamming spheres, decoding regions and the standard array; 1.4 Weight distribution and error performance
1.4.1 Weight distribution and undetected error probability over a BSC1.4.2 Performance bounds over BSC, AWGN and fading channels; 1.5 General structure of a hard-decision decoder of linear codes; Problems; 2 Hamming, Golay and Reed-Muller codes; 2.1 Hamming codes; 2.1.1 Encoding and decoding procedures; 2.2 The binary Golay code; 2.2.1 Encoding; 2.2.2 Decoding; 2.2.3 Arithmetic decoding of the extended (24, 12, 8) Golay code; 2.3 Binary Reed-Muller codes; 2.3.1 Boolean polynomials and RM codes; 2.3.2 Finite geometries and majority-logic decoding; Problems; 3 Binary cyclic codes and BCH codes
3.1 Binary cyclic codes3.1.1 Generator and parity-check polynomials; 3.1.2 The generator polynomial; 3.1.3 Encoding and decoding of binary cyclic codes; 3.1.4 The parity-check polynomial; 3.1.5 Shortened cyclic codes and CRC codes; 3.1.6 Fire codes; 3.2 General decoding of cyclic codes; 3.2.1 GF(2m) arithmetic; 3.3 Binary BCH codes; 3.3.1 BCH bound; 3.4 Polynomial codes; 3.5 Decoding of binary BCH codes; 3.5.1 General decoding algorithm for BCH codes; 3.5.2 The Berlekamp-Massey algorithm (BMA); 3.5.3 PGZ decoder; 3.5.4 Euclidean algorithm; 3.5.5 Chien search and error correction
3.5.6 Errors-and-erasures decoding3.6 Weight distribution and performance bounds; 3.6.1 Error performance evaluation; Problems; 4 Nonbinary BCH codes: Reed-Solomon codes; 4.1 RS codes as polynomial codes; 4.2 From binary BCH to RS codes; 4.3 Decoding RS codes; 4.3.1 Remarks on decoding algorithms; 4.3.2 Errors-and-erasures decoding; 4.4 Weight distribution; Problems; 5 Binary convolutional codes; 5.1 Basic structure; 5.1.1 Recursive systematic convolutional codes; 5.1.2 Free distance; 5.2 Connections with block codes; 5.2.1 Zero-tail construction; 5.2.2 Direct-truncation construction
5.2.3 Tail-biting construction5.2.4 Weight distributions; 5.3 Weight enumeration; 5.4 Performance bounds; 5.5 Decoding: Viterbi algorithm with Hamming metrics; 5.5.1 Maximum-likelihood decoding and metrics; 5.5.2 The Viterbi algorithm; 5.5.3 Implementation issues; 5.6 Punctured convolutional codes; 5.6.1 Implementation issues related to punctured convolutional codes; 5.6.2 RCPC codes; Problems; 6 Modifying and combining codes; 6.1 Modifying codes; 6.1.1 Shortening; 6.1.2 Extending; 6.1.3 Puncturing; 6.1.4 Augmenting, expurgating and lengthening; 6.2 Combining codes
6.2.1 Time sharing of codes
Record Nr. UNINA-9910143714103321
Morelos-Zaragoza Robert H  
Hoboken, : Wiley, 2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui