Applied Algebra, Algebraic Algorithms and Error-Correcting Codes de Marc Fossorier

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 13th International Symposium, AAECC-13 Honolulu, Hawaii, USA, November 15-19, 1999 Proceedings: Lecture Notes in Computer Science, cartea 1719

Marc Fossorier

Hideki Imai

Shu Lin

Alain Poli

This book constitutes the refereed proceedings of the 19th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-13, held in Honolulu, Hawaii, USA in November 1999.
The 42 revised full papers presented together with six invited survey papers were carefully reviewed and selected from a total of 86 submissions. The papers are organized in sections on codes and iterative decoding, arithmetic, graphs and matrices, block codes, rings and fields, decoding methods, code construction, algebraic curves, cryptography, codes and decoding, convolutional codes, designs, decoding of block codes, modulation and codes, Gröbner bases and AG codes, and polynomials.

Citește tot Restrânge

	Preț	Express
Paperback (2)	343^.95 lei 43-57 zile
Springer Berlin, Heidelberg – 3 noi 1999	343^.95 lei 43-57 zile
Springer Berlin, Heidelberg – 3 feb 2006	391^.61 lei 43-57 zile

Preț

Express

Paperback (2)

343^.95 lei 43-57 zile

Springer Berlin, Heidelberg – 3 noi 1999

343^.95 lei 43-57 zile

Springer Berlin, Heidelberg – 3 feb 2006

391^.61 lei 43-57 zile

Din seria Lecture Notes in Computer Science

20%

Preț: 1061^.55 lei
20%

Preț: 307^.71 lei
20%

Preț: 438^.69 lei
20%

Preț: 645^.28 lei
Preț: 410^.88 lei
15%

Preț: 580^.46 lei
17%

Preț: 427^.22 lei
20%

Preț: 596^.46 lei
Preț: 381^.21 lei
20%

Preț: 353^.50 lei
20%

Preț: 1414^.79 lei
20%

Preț: 309^.90 lei
20%

Preț: 583^.40 lei
20%

Preț: 1075^.26 lei
20%

Preț: 310^.26 lei
20%

Preț: 655^.02 lei
20%

Preț: 580^.93 lei
20%

Preț: 340^.32 lei
15%

Preț: 438^.59 lei
20%

Preț: 591^.51 lei
20%

Preț: 649^.49 lei
20%

Preț: 337^.00 lei
Preț: 449^.57 lei
20%

Preț: 607^.39 lei
20%

Preț: 1024^.44 lei
20%

Preț: 579^.30 lei
20%

Preț: 763^.23 lei
20%

Preț: 453^.32 lei
20%

Preț: 575^.48 lei
20%

Preț: 585^.88 lei
20%

Preț: 825^.93 lei
20%

Preț: 763^.23 lei
17%

Preț: 360^.19 lei
20%

Preț: 1183^.14 lei
20%

Preț: 340^.32 lei
20%

Preț: 504^.57 lei
20%

Preț: 369^.12 lei
20%

Preț: 583^.40 lei
20%

Preț: 343^.62 lei
20%

Preț: 350^.21 lei
20%

Preț: 764^.89 lei
20%

Preț: 583^.40 lei
Preț: 389^.48 lei
20%

Preț: 341^.95 lei
20%

Preț: 238^.01 lei
20%

Preț: 538^.29 lei

Cuprins

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 onerational 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.