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

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

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

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