LEADER 05204nam 22007455 450 001 996465794303316 005 20200630024053.0 010 $a3-540-48357-8 024 7 $a10.1007/3-540-57843-9 035 $a(CKB)1000000000234092 035 $a(SSID)ssj0000321094 035 $a(PQKBManifestationID)11260280 035 $a(PQKBTitleCode)TC0000321094 035 $a(PQKBWorkID)10262708 035 $a(PQKB)10106299 035 $a(DE-He213)978-3-540-48357-1 035 $a(PPN)155182056 035 $a(EXLCZ)991000000000234092 100 $a20121227d1994 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgebraic Coding$b[electronic resource] $eFirst French-Israeli Workshop, Paris, France, July 19 - 21, 1993. Proceedings /$fedited by Gerard Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zemor 205 $a1st ed. 1994. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994. 215 $a1 online resource (XII, 332 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v781 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-57843-9 327 $aA necessary and sufficient condition for time-variant convolutional encoders to be noncatastrophic -- On the design and selection of convolutional codes for a bursty Rician channel -- Modulo-2 separable linear codes -- Estimation of the size of the list when decoding over an arbitrarily varying channel -- A lower bound on binary codes with covering radius one -- On some mixed covering codes of small length -- The length function: A revised table -- On the covering radius of convolutional codes -- Efficient multi-signature schemes for cooperating entities -- Montgomery-suitable cryptosystems -- Secret sharing schemes with veto capabilities -- Group-theoretic hash functions -- On constructions for optimal optical orthogonal codes -- On complementary sequences -- Spectral-null codes and null spaces of Hadamard submatrices -- On small families of sequences with low periodic correlation -- Disjoint systems (Extended abstract) -- Some sufficient conditions for 4-regular graphs to have 3-regular subgraphs -- Detection and location of given sets of errors by nonbinary linear codes -- Quaternary constructions of formally self-dual binary codes and unimodular lattices -- New lower bounds for some spherical designs -- Lattices based on linear codes -- Quantizing and decoding for usual lattices in the L p -metric -- Bounded-distance decoding of the Leech lattice and the Golay code -- Some restrictions on distance distribution of optimal binary codes -- Two new upper bounds for codes of distance 3 -- On Plotkin-Elias type bounds for binary arithmetic codes -- Bounds on generalized weights -- Threshold effects in codes -- Decoding a bit more than the BCH bound -- Product codes and the singleton bound -- Erasure correction performance of linear block codes. 330 $aThis volume presents the proceedings of the first French-Israeli Workshop on Algebraic Coding, which took place in Paris in July 1993. The workshop was a continuation of a French-Soviet Workshop held in 1991 and edited by the same board. The thoroughly refereed papers in this volume are grouped into parts on: convolutional codes and special channels, covering codes, cryptography, sequences, graphs and codes, sphere packings and lattices, and bounds for codes. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v781 606 $aComputers 606 $aCoding theory 606 $aInformation theory 606 $aData encryption (Computer science) 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 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 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$aData encryption (Computer science). 615 0$aCombinatorics. 615 0$aElectrical engineering. 615 14$aTheory of Computation. 615 24$aCoding and Information Theory. 615 24$aCryptology. 615 24$aCombinatorics. 615 24$aCommunications Engineering, Networks. 676 $a004.0151 702 $aCohen$b Gerard$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLitsyn$b Simon$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 $a996465794303316 996 $aAlgebraic coding$9254082 997 $aUNISA LEADER 03887oam 2200469I 450 001 9910155108403321 005 20240505171846.0 010 $a1-351-73768-6 010 $a1-315-18663-2 010 $a1-351-73769-4 024 7 $a10.1201/9781315186634 035 $a(CKB)3710000000973138 035 $a(MiAaPQ)EBC4769135 035 $a(OCoLC)965905270 035 $a(EXLCZ)993710000000973138 100 $a20180420d2016 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aAnalyzing longitudinal clinical trial data $ea practical guide /$fby Craig Mallinckrodt and Ilya Lipkovich 205 $a1st ed. 210 1$aBoca Raton, FL :$cChapman and Hall/CRC, an imprint of Taylor and Francis,$d2016. 215 $a1 online resource (330 pages) $cillustrations, tables 225 1 $aChapman & Hall/CRC Biostatistics Series 311 08$a1-4987-6531-9 320 $aIncludes bibliographical references and index. 327 $aCover -- Half Title -- Title Page -- Copyright Page -- Table of Contents -- Preface -- Acknowledgments -- List of Tables -- List of Figures -- List of Code Fragments -- Section I: Background and Setting -- 1: Introduction -- 2: Objectives and Estimands?Determining What to Estimate -- 3: Study Design?Collecting the Intended Data -- 4: Example Data -- 5: Mixed-Effects Models Review -- Section II: Modeling the Observed Data -- 6: Choice of Dependent Variable and Statistical Test -- 7: Modeling Covariance (Correlation) -- 8: Modeling Means Over Time -- 9: Accounting for Covariates -- 10: Categorical Data -- 11: Model Checking and Verification -- Section III: Methods for Dealing with Missing Data -- 12: Overview of Missing Data -- 13: Simple and Ad Hoc Approaches for Dealing with Missing Data -- 14: Direct Maximum Likelihood -- 15: Multiple Imputation -- 16: Inverse Probability Weighted Generalized Estimated Equations -- 17: Doubly Robust Methods -- 18: MNAR Methods -- 19: Methods for Incomplete Categorical Data -- Section IV: A Comprehensive Approach to Study Development and Analyses -- 20: Developing Statistical Analysis Plans -- 21: Example Analyses of Clinical Trial Data -- References -- Index. 330 3 $aAnalyzing Longitudinal Clinical Trial Data: A Practical Guide provides practical and easy to implement approaches for bringing the latest theory on analysis of longitudinal clinical trial data into routine practice. The book, with its example-oriented approach that includes numerous SAS and R code fragments, is an essential resource for statisticians and graduate students specializing in medical research. The authors provide clear descriptions of the relevant statistical theory and illustrate practical considerations for modeling longitudinal data. Topics covered include choice of endpoint and statistical test; modeling means and the correlations between repeated measurements; accounting for covariates; modeling categorical data; model verification; methods for incomplete (missing) data that includes the latest developments in sensitivity analyses, along with approaches for and issues in choosing estimands; and means for preventing missing data. Each chapter stands alone in its coverage of a topic. The concluding chapters provide detailed advice on how to integrate these independent topics into an over-arching study development process and statistical analysis plan. 410 0$aChapman & Hall/CRC biostatistics series. 606 $aClinical trials$vLongitudinal studies 615 0$aClinical trials 676 $a615.5072/4 700 $aMallinckrodt$b Craig H.$f1958,$01212156 702 $aLipkovich$b Ilya 801 0$bFlBoTFG 801 1$bFlBoTFG 906 $aBOOK 912 $a9910155108403321 996 $aAnalyzing longitudinal clinical trial data$92799011 997 $aUNINA