Coding Theory and Applications
Springer Berlin (Verlag)
978-3-540-87447-8 (ISBN)
A Diametric Theorem in for Lee and Related Distances.- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3).- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm.- How to Know if a Linear Code Is a Group Code?.- Witness Sets.- On Rank and Kernel of ?4-Linear Codes.- Classic and Quantum Error Correcting Codes.- Evaluating the Impact of Information Distortion on Normalized Compression Distance.- Codes from Expander Graphs.- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation.- Minimal Trellis Construction for Finite Support Convolutional Ring Codes.- On the Quasi-cyclicity of the Gray Map Image of a Class of Codes over Galois Rings.- Algebraic Geometry Codes from Castle Curves.- Two-Point Codes on Norm-Trace Curves.- Close Encounters with Boolean Functions of Three Different Kinds.- Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization.- On the Kronecker Product Construction of Completely Transitive q-Ary Codes.- Quaternary Unequal Error Protection Codes.- Communication on Inductively Coupled Channels: Overview and Challenges.
Erscheint lt. Verlag | 5.9.2008 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | VIII, 197 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 323 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | Algebra • Algebraic Geometry • Algebraic-geometry codes • Calculus • castle curve • Codes and applications • Codes and combinatorial structures • coding theory • Communication • compression distance • coupled channels • error correcting code • error protecting codes • galois ring • group code • Group codes • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Information • johnson graph • Lee distance • network coding • quantum codes • secure network coding |
ISBN-10 | 3-540-87447-X / 354087447X |
ISBN-13 | 978-3-540-87447-8 / 9783540874478 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich