LEADER 04547nam 22007455 450 001 996465642403316 005 20200705030928.0 010 $a3-540-46739-4 024 7 $a10.1007/BFb0034333 035 $a(CKB)1000000000233776 035 $a(SSID)ssj0000321093 035 $a(PQKBManifestationID)11262209 035 $a(PQKBTitleCode)TC0000321093 035 $a(PQKBWorkID)10263822 035 $a(PQKB)10074885 035 $a(DE-He213)978-3-540-46739-7 035 $a(PPN)155199811 035 $a(EXLCZ)991000000000233776 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgebraic Coding$b[electronic resource] $eFirst French-Soviet Workshop, Paris, July 22-24, 1991. Proceedings /$fedited by Gerard Cohen, Simon N. Litsyn, Antoine Lobstein, Gilles Zemor 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (XI, 161 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v573 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-55130-1 327 $aOn the correlation of sequences -- On Gaussian sums for finite fields and elliptic curves -- Exponential sums and constrained error-correcting codes -- Constructions of codes with covering radius 2 -- On perfect weighted coverings with small radius -- An extremal problem related to the covering radius of binary codes -- Bounds on covering radius of dual product codes -- Remarks on greedy codes -- On nonbinary codes with fixed distance -- Saddle point techniques in asymptotic coding theory -- Non-binary low rate convolutional codes with almost optimum weight spectrum -- Position recovery on a circle based on coding theory -- The lower bound for cardinality of codes correcting errors and defects -- Soft decoding for block codes obtained from convolutional codes -- Partial ordering of error patterns for maximum likelihood soft decoding -- A fast matrix decoding algorithm for rank-error-correcting codes -- A fast search for the maximum element of the fourier spectrum -- Coding theorem for discrete memoryless channels with given decision rule -- Decoding for multiple-access channels. 330 $aThis volume presents the proceedings of the first French-Soviet workshop on algebraic coding, held in Paris in July 1991. The idea for the workshop, born in Leningrad (now St. Petersburg) in 1990, was to bring together some of the best Soviet coding theorists. Scientists from France, Finland, Germany, Israel, Italy, Spain, and the United States also attended. The papers in the volume fall rather naturally into four categories: - Applications of exponential sums - Covering radius - Constructions -Decoding. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v573 606 $aComputers 606 $aCoding theory 606 $aInformation theory 606 $aAlgebraic geometry 606 $aCombinatorics 606 $aElectrical engineering 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041 606 $aAlgebraic Geometry$3https://scigraph.springernature.com/ontologies/product-market-codes/M11019 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aCommunications Engineering, Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/T24035 615 0$aComputers. 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aAlgebraic geometry. 615 0$aCombinatorics. 615 0$aElectrical engineering. 615 14$aTheory of Computation. 615 24$aCoding and Information Theory. 615 24$aAlgebraic Geometry. 615 24$aCombinatorics. 615 24$aCommunications Engineering, Networks. 676 $a003/.54 702 $aCohen$b Gerard$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLitsyn$b Simon N$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLobstein$b Antoine$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aZemor$b Gilles$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465642403316 996 $aAlgebraic coding$9254082 997 $aUNISA