Applied algebra, algebraic algorithms, and error correcting codes : 13th international symposium, AAECC 13, Ho
User Rating: Be the first one!
Author: AAECC-13 (1999 : Honolulu, Hawaii), Fossorier, Marc, 1964-
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Error-correcting codes (Information theory), Algebra, Algorithms
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540667237
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 245.16 MB
PDF Size: 5.15 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 727
Views: 777
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 46796 3 archive t...torrent
Last Modified: 2022-03-09 08:47:41
Download
Size: 13.69 KB
Description
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 13th International Symposium, AAECC-13 Honolulu, Hawaii, USA, November 15–19, 1999 Proceedings
Author: Marc Fossorier, Hideki Imai, Shu Lin, Alain Poli
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66723-0
DOI: 10.1007/3-540-46796-3
Table of Contents:
Includes bibliographical references and index
Author: Marc Fossorier, Hideki Imai, Shu Lin, Alain Poli
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66723-0
DOI: 10.1007/3-540-46796-3
Table of Contents:
- 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
- New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity
- On the Theory of Low-Density Convolutional Codes
- On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders
- A New Representation of Boolean Functions
- An Algorithm to Compute a Nearest Point in the Lattice A
- Sequences from Cocycles
- On the Second Greedy Weight for Binary Linear Codes
- On the Size of Identifying Codes
- 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
- 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
Includes bibliographical references and index
You May Also Like
We will be happy to hear your thoughts