Discrete Applied Mathematics, Volume 128

Volume 128, Number 1, 15 May 2003

• Claude Carlet:
  Preface. 1
  Electronic Edition (link) BibTeX
• Taher Abualrub, Robert H. Oehmke:
  Cyclic Codes of Length 2^e Over Z₄. 3-9
  Electronic Edition (link) BibTeX
• Toby Berger, Vladimir I. Levenshtein:
  Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing. 11-26
  Electronic Edition (link) BibTeX
• Thomas Blackford:
  Cyclic Codes Over Z₄ of Oddly Even Length. 27-46
  Electronic Edition (link) BibTeX
• Carlo Blundo, Paolo D'Arco, Carles Padró:
  A Ramp Model for Distributed Key Distribution Schemes. 47-64
  Electronic Edition (link) BibTeX
• Yuri L. Borissov, Nickolai Manev, Svetla Nikova:
  On the Non-minimal Codewords in Binary Reed-Muller Codes. 65-74
  Electronic Edition (link) BibTeX
• Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun:
  Intersecting Codes and Separating Codes. 75-83
  Electronic Edition (link) BibTeX
• Danyo Danev:
  Some Constructions of Superimposed Codes in Euclidean Spaces. 85-101
  Electronic Edition (link) BibTeX
• Cunsheng Ding, Chaoping Xing:
  Several Classes of (2^m-1, w, 2) Optical Orthogonal Codes. 103-120
  Electronic Edition (link) BibTeX
• Steven T. Dougherty, T. Aaron Gulliver, Manabu Oura:
  Higher Weights and Graded Rings for Binary Self-dual Codes. 121-143
  Electronic Edition (link) BibTeX
• José Ignacio Farrán, Carlos Munuera:
  Goppa-like Bounds for the Generalized Feng-Rao Distances. 145-156
  Electronic Edition (link) BibTeX
• Fang-Wei Fu, Torleiv Kløve, Luo Yuan, Victor K. Wei:
  On Equidistant Constant Weight Codes. 157-164
  Electronic Edition (link) BibTeX
• Steven D. Galbraith:
  Weil Descent of Jacobians. 165-180
  Electronic Edition (link) BibTeX
• Lars R. Knudsen, Chris J. Mitchell:
  Analysis of 3gpp-MAC and Two-key 3gpp-MAC. 181-191
  Electronic Edition (link) BibTeX
• Tanja Lange, Arne Winterhof:
  Interpolation of the Discrete Logarithm in F_q by Boolean Functions and by Polynomials in Several Variables Modulo a Divisor of Q-1. 193-206
  Electronic Edition (link) BibTeX
• Alexei V. Ourivski, Ernst M. Gabidulin:
  Column Scrambler for the GPT Cryptosystem. 207-221
  Electronic Edition (link) BibTeX
• Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
  Linear Broadcast Encryption Schemes. 223-238
  Electronic Edition (link) BibTeX
• Germán Sáez:
  Generation of Key Predistribution Schemes Using Secret Sharing Schemes. 239-249
  Electronic Edition (link) BibTeX
• Hans Georg Schaathun, Wolfgang Willems:
  A Lower Bound on the Weight Hierarchies of Product Codes. 251-261
  Electronic Edition (link) BibTeX
• Keisuke Shiromoto, Leo Storme:
  A Griesmer Bound for Linear Codes Over Finite Quasi-Frobenius Rings. 263-274
  Electronic Edition (link) BibTeX
• Gintaras Skersys:
  The Average Dimension of the Hull of Cyclic Codes. 275-292
  Electronic Edition (link) BibTeX
• Emina Soljanin, Elke Offer:
  Bit-optimal Decoding of Codes Whose Tanner Graphs Are Trees. 293-303
  Electronic Edition (link) BibTeX
• Horacio Tapia-Recillas, Gerardo Vega:
  Some Constacyclic Codes Over Z₂k and Binary Quasi-cyclic Codes. 305-316
  Electronic Edition (link) BibTeX

Volume 128, Number 2-3, June 2003

• Eddie Cheng, Jerrold W. Grossman, Marc J. Lipman:
  Time-stamped Graphs and Their Associated Influence Digraphs. 317-335
  Electronic Edition (link) BibTeX
• Mauro Dell'Amico, Francesco Maffioli, Federico Malucelli:
  The Base-matroid and Inverse Combinatorial Optimization Problems. 337-353
  Electronic Edition (link) BibTeX
• Elaine M. Eschen, Julie L. Johnson, Jeremy Spinrad, R. Sritharan:
  Recognition of Some Perfectly Orderable Graph Classes. 355-373
  Electronic Edition (link) BibTeX
• Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann:
  A Linear-programming Approach to the Generalized Randic Index. 375-385
  Electronic Edition (link) BibTeX
• David Hartvigsen:
  Characterizing the Flow Equivalent Trees of a Network. 387-394
  Electronic Edition (link) BibTeX
• Tamás Kis, Alain Hertz:
  A Lower Bound for the Job Insertion Problem. 395-419
  Electronic Edition (link) BibTeX
• Guizhen Liu, Binhai Zhu:
  Some Problems on Factorizations with Constraints in Bipartite Graphs. 421-434
  Electronic Edition (link) BibTeX
• Annalisa Massini:
  All-to-all Personalized Communication on Multistage Interconnection Networks. 435-446
  Electronic Edition (link) BibTeX
• Juan Rada, Carlos Uzcátegui:
  Randic Structure of a Graph. 447-463
  Electronic Edition (link) BibTeX
• Peggy Sullivan:
  Cut, Paste, Filter. 465-485
  Electronic Edition (link) BibTeX
• Igor E. Zverovich:
  Extension of Hereditary Classes with Substitutions. 487-509
  Electronic Edition (link) BibTeX
• Christian Blum, Matthias Ehrgott:
  Local Search Algorithms for the k-cardinality Tree Problem. 511-540
  Electronic Edition (link) BibTeX
• Gunnar Brinkmann, Thomas Harmuth, Oliver Heidemeier:
  The Construction of Cubic and Quartic Planar Maps with Prescribed Face Degrees. 541-554
  Electronic Edition (link) BibTeX
• Alison Bailey, Gary Gordon, Matthew Patton, Jennifer Scancella:
  Expected Value Expansions in Rooted Graphs. 555-571
  Electronic Edition (link) BibTeX