Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             58 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Generalization of Negacyclic Codes Tapia-Recillas, H.
 2001
 6 C p. 251-261
11 p.
 artikel
2 A Griesmer Bound for Codes over Finite Quasi-Frobenius Rings Shiromoto, Keisuke
 2001
 6 C p. 337-345
9 p.
 artikel
3 A hypergraph approach to the identifying parent property: the case of multiple parents Barg, Alexander
 2001
 6 C p. 1-3
3 p.
 artikel
4 A lattice-based McEliece scheme for encryption and signature Solé, P.
 2001
 6 C p. 402-411
10 p.
 artikel
5 An analysis of the 3gpp-MAC scheme Knudsen, Lars R.
 2001
 6 C p. 346-355
10 p.
 artikel
6 Application of cover-free codes and combinatorial designs to two-stage testing Berger, T.
 2001
 6 C p. 518-527
10 p.
 artikel
7 A Ramp Model for Distributed Key Distribution Schemes Blundo, Carlo
 2001
 6 C p. 45-54
10 p.
 artikel
8 Binary Images of Cyclic codes over Z 4 Wolfmann, J.
 2001
 6 C p. 281-286
6 p.
 artikel
9 Bounding minimum distances of cyclic codes using algebraic geometry Boston, Nigel
 2001
 6 C p. 385-394
10 p.
 artikel
10 Codes for Strong Identification Honkala, Iiro
 2001
 6 C p. 262-270
9 p.
 artikel
11 Cyclic Codes of Length 2 e over Z 4 Abualrub, T.
 2001
 6 C p. 491-497
7 p.
 artikel
12 Cyclic Codes over Z 4 of Oddly Even Length Blackford, T.
 2001
 6 C p. 528-537
10 p.
 artikel
13 Decoding a Class of Alternant Codes for the Lee Metric Byrne, Eimear
 2001
 6 C p. 178-186
9 p.
 artikel
14 Decomposing Quasi-Cyclic Codes Ling, San
 2001
 6 C p. 412-422
11 p.
 artikel
15 Defining Sets of Cyclic Codes Invariant Under the Affine Group Abdukhalikov, Kanat
 2001
 6 C p. 328-336
9 p.
 artikel
16 Dependent rational points on curves over finite fields - Lefschetz theorems and exponential sums Hansen, Johan P.
 2001
 6 C p. 297-309
13 p.
 artikel
17 Estimates of the Distance Distribution of Codes and Designs 1 1 Research supported in part by Binational Science Foundation (BSF) under grant 1999099 Ashikhmin, A.
 2001
 6 C p. 4-14
11 p.
 artikel
18 Generalised Rudin-Shapiro Constructions Parker, Matthew G.
 2001
 6 C p. 364-374
11 p.
 artikel
19 Generation of Key Predistribution Schemes using Secret Sharing Schemes Sáez, Germán
 2001
 6 C p. 220-229
10 p.
 artikel
20 Goppa-like bounds for the generalized Feng-Rao distances 1 1 Extended abstract of a talk presented at WCC2001, Paris. Farrán, J.I.
 2001
 6 C p. 318-327
10 p.
 artikel
21 Higher Weights and Binary Self-Dual Codes Dougherty, Steven T.
 2001
 6 C p. 469-480
12 p.
 artikel
22 Highly Nonlinear Balanced Boolean Functions with Very Good Autocorrelation Property Maitra, Subhamoy
 2001
 6 C p. 481-490
10 p.
 artikel
23 Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions Lange, Tanja
 2001
 6 C p. 498-506
9 p.
 artikel
24 Intersecting codes and partially identifying codes Cohen, G.
 2001
 6 C p. 211-219
9 p.
 artikel
25 LDPC codes: a group algebra formulation 1 1 This work was supported by the 1999 German-American Networking Research Grant given by the national academics of engineering of Germany and the USA, URLs: cm.bell-labs.com/e~mina www.lnt.ei.tum.de Soljanin, E.
 2001
 6 C p. 148-157
10 p.
 artikel
26 Linear and Differential Cryptanalysis of Russian GOST Shorin, Vitaly V.
 2001
 6 C p. 538-547
10 p.
 artikel
27 Linear broadcast encryption schemes Padró, Carles
 2001
 6 C p. 35-44
10 p.
 artikel
28 Linear Recursive MDS-Codes and Asturian codes Couselo, Elena
 2001
 6 C p. 140-147
8 p.
 artikel
29 Modified GPT PKC with Right Scrambler Gabidulin, E.M.
 2001
 6 C p. 168-177
10 p.
 artikel
30 Multicovering Bounds from Linear Inequalities (Extended Abstract) Klapper, Andrew
 2001
 6 C p. 25-34
10 p.
 artikel
31 New Constructions of Resilient and Correlation Immune Boolean Functions Achieving Upper Bound on Nonlinearity Pasalic, E.
 2001
 6 C p. 158-167
10 p.
 artikel
32 New Decoding Error Probability Bounds for Fixed Convolutional Codes used in BSC Truhachev, Dmitri V.
 2001
 6 C p. 123-131
9 p.
 artikel
33 New Families of Ideal 2-Level Autocorrelation Ternary Sequences From Second Order DHT Ludkovski, Michael
 2001
 6 C p. 375-384
10 p.
 artikel
34 On Equidistant Constant Weight Codes Fu, Fang-Wei
 2001
 6 C p. 187-194
8 p.
 artikel
35 On Extremal Additive F 4 Codes of Length 10 to 18 Bachoc, Christine
 2001
 6 C p. 55-64
10 p.
 artikel
36 On Quadratic Double Circulant Codes over Fields Gaborit, Philippe
 2001
 6 C p. 423-432
10 p.
 artikel
37 On Some Uniformity of Distribution Properties of ESIGN El Mahassni, Edwin
 2001
 6 C p. 132-139
8 p.
 artikel
38 On the metrical rigidity of binary codes Avgustinovich, S.V.
 2001
 6 C p. 444-451
8 p.
 artikel
39 On the Minimum Weights of Type IV Codes over Z 4 with Certain Lengths Bouyuklieva, Stefka
 2001
 6 C p. 452-458
7 p.
 artikel
40 On the Non-Minimal codewords of weight 2d min in the binary Reed-Muller Code Borissov, Yuri
 2001
 6 C p. 548-555
8 p.
 artikel
41 On the Optimality of Finite Constellations from Algebraic Lattices Interlando, J.Carmelo
 2001
 6 C p. 271-280
10 p.
 artikel
42 On Weight Hierarchies of Product Codes The Wei-Yang Conjecture and more Martínez-Pérez, Conchita
 2001
 6 C p. 65-71
7 p.
 artikel
43 Perfect Codes and Balanced Generalized Weighing Matrices, II Jungnickel, Dieter
 2001
 6 C p. 113-122
10 p.
 artikel
44 Performance Limits of Compound Codes with Symbol-Based Iterative Decoding Sawaya, H.
 2001
 6 C p. 433-443
11 p.
 artikel
45 Polynomial invariants for binary linear codes Maks, Johannes
 2001
 6 C p. 310-317
8 p.
 artikel
46 Preface Augot, Daniel
 2001
 6 C p. 556-557
2 p.
 artikel
47 Quantum Identification Protocol with Technologically Bounded Parties Nascimento, Anderson C.A.
 2001
 6 C p. 15-24
10 p.
 artikel
48 Reliability-Based Soft-Decision Decoding with Iterative Information Set Reduction 1 1 Supported by NSF Grant CCR-97-32959. Fossorier, Marc
 2001
 6 C p. 356-363
8 p.
 artikel
49 Sequences with good correlations and some open problems Helleseth, Tor
 2001
 6 C p. 507-517
11 p.
 artikel
50 Several Classes of (2 m − 1, w, 2) Optical Orthogonal Codes Ding, Cunsheng
 2001
 6 C p. 72-97
26 p.
 artikel
51 Strong Gröbner bases and cyclic codes over a finite-chain ring. 2 2 Research supported by the U.K. Engineering and Physical Sciences Research Council under Grant L07680, while the authors were with the Algebraic Coding Research Group, Centre for Communications Research, University of Bristol, U.K. Norton, Graham H.
 2001
 6 C p. 240-250
11 p.
 artikel
52 Superimposed Codes in R n Obtained from Spherical Codes Danev, Danyo
 2001
 6 C p. 98-106
9 p.
 artikel
53 Symbol-by-symbol Decoding as an Approximation of Word-by-word Decoding Battail, Gérard
 2001
 6 C p. 195-210
16 p.
 artikel
54 The average dimension of the hull of cyclic codes Skersys, Gintaras
 2001
 6 C p. 230-239
10 p.
 artikel
55 The number of inequivalent irreducible Goppa codes Fitzpatrick, Patrick
 2001
 6 C p. 395-401
7 p.
 artikel
56 The Structure of Linear Codes of Constant Weight Wood, Jay A.
 2001
 6 C p. 287-296
10 p.
 artikel
57 Weil Descent Of Jacobians Galbraith, Steven D.
 2001
 6 C p. 459-468
10 p.
 artikel
58 Z 4-linear Hadamard and extended perfect codes Krotov, D.S.
 2001
 6 C p. 107-112
6 p.
 artikel
                             58 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland