000 03994nam a22006495i 4500
001 978-3-540-87448-5
003 DE-He213
005 20240730181920.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540874485
_9978-3-540-87448-5
024 7 _a10.1007/978-3-540-87448-5
_2doi
050 4 _aQA268
050 4 _aQ350-390
072 7 _aGPJ
_2bicssc
072 7 _aGPF
_2bicssc
072 7 _aCOM031000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aGPF
_2thema
082 0 4 _a003.54
_223
245 1 0 _aCoding Theory and Applications
_h[electronic resource] :
_b2nd International Castle Meeting, ISMCTA 2008, Castillo de la Mota, Medina del Campo, Spain, September 15-19, 2008, Proceedings /
_cedited by Angela Barbero.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aVIII, 197 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5228
505 0 _aA 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.
520 _aThis book constitutes the refereed proceedings of the 2nd International Castle Meeting, ISMCTA 2008, Castillo de la Mota, Medina del Campo, Spain, September 2008. The 14 full papers and 5 invited papers presented were carefully reviewed and selected from 34 submissions for inclusion in the book. The papers cover network coding, quantum codes, group codes, codes and combinatorial structures, agebraic-geometry codes, as well as codes and applications.
650 0 _aCoding theory.
_94154
650 0 _aInformation theory.
_914256
650 0 _aAlgebra.
_921222
650 0 _aAlgebraic geometry.
_9126584
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aCryptography.
_91973
650 0 _aData encryption (Computer science).
_99168
650 1 4 _aCoding and Information Theory.
_9126585
650 2 4 _aAlgebra.
_921222
650 2 4 _aAlgebraic Geometry.
_9126586
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
650 2 4 _aCryptology.
_931769
700 1 _aBarbero, Angela.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9126587
710 2 _aSpringerLink (Online service)
_9126588
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540874478
776 0 8 _iPrinted edition:
_z9783540875079
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5228
_9126589
856 4 0 _uhttps://doi.org/10.1007/978-3-540-87448-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91135
_d91135