|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-31424-0 |
| 003 |
DE-He213 |
| 005 |
20230221050910.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100419s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540314240
|9 978-3-540-31424-0
|
| 024 |
7 |
|
|a 10.1007/11617983
|2 doi
|
| 050 |
|
4 |
|a QA268
|
| 050 |
|
4 |
|a Q350-390
|
| 072 |
|
7 |
|a GPJ
|2 bicssc
|
| 072 |
|
7 |
|a GPF
|2 bicssc
|
| 072 |
|
7 |
|a COM031000
|2 bisacsh
|
| 072 |
|
7 |
|a GPJ
|2 thema
|
| 072 |
|
7 |
|a GPF
|2 thema
|
| 082 |
0 |
4 |
|a 003.54
|2 23
|
| 245 |
1 |
0 |
|a Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
|h [electronic resource] :
|b 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings /
|c edited by Marc Fossorier, Hideki Imai, Shu Lin, Alain Poli.
|
| 250 |
|
|
|a 1st ed. 2006.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XII, 344 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3857
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Coding theory.
|
| 650 |
|
0 |
|a Information theory.
|
| 650 |
|
0 |
|a Cryptography.
|
| 650 |
|
0 |
|a Data encryption (Computer science).
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
1 |
4 |
|a Coding and Information Theory.
|
| 650 |
2 |
4 |
|a Cryptology.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 700 |
1 |
|
|a Fossorier, Marc.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Imai, Hideki.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Lin, Shu.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Poli, Alain.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540819851
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540314233
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3857
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11617983
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
