default search action
Discrete Applied Mathematics, Volume 128
Volume 128, Number 1, 15 May 2003
- Claude Carlet:
Preface. 1 - Taher Abualrub
, Robert H. Oehmke:
Cyclic Codes of Length 2e Over Z4. 3-9 - Toby Berger, Vladimir I. Levenshtein:
Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing. 11-26 - Thomas Blackford:
Cyclic Codes Over Z4 of Oddly Even Length. 27-46 - Carlo Blundo
A Ramp Model for Distributed Key Distribution Schemes. 47-64 - Yuri L. Borissov, Nikolai L. Manev, Svetla Nikova
On the Non-minimal Codewords in Binary Reed-Muller Codes. 65-74 - Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun:
Intersecting Codes and Separating Codes. 75-83 - Danyo Danev
Some Constructions of Superimposed Codes in Euclidean Spaces. 85-101 - Cunsheng Ding
Several Classes of (2m-1, w, 2) Optical Orthogonal Codes. 103-120 - Steven T. Dougherty, T. Aaron Gulliver, Manabu Oura:
Higher Weights and Graded Rings for Binary Self-dual Codes. 121-143 - José Ignacio Farrán, Carlos Munuera
Goppa-like Bounds for the Generalized Feng-Rao Distances. 145-156 - Fang-Wei Fu, Torleiv Kløve, Luo Yuan, Victor K. Wei:
On Equidistant Constant Weight Codes. 157-164 - Steven D. Galbraith
Weil Descent of Jacobians. 165-180 - Lars R. Knudsen, Chris J. Mitchell
Analysis of 3gpp-MAC and Two-key 3gpp-MAC. 181-191 - Tanja Lange, Arne Winterhof
Interpolation of the Discrete Logarithm in Fq by Boolean Functions and by Polynomials in Several Variables Modulo a Divisor of Q-1. 193-206 - Alexei V. Ourivski, Ernst M. Gabidulin:
Column Scrambler for the GPT Cryptosystem. 207-221 - Carles Padró
Linear Broadcast Encryption Schemes. 223-238 - Germán Sáez:
Generation of Key Predistribution Schemes Using Secret Sharing Schemes. 239-249 - Hans Georg Schaathun, Wolfgang Willems:
A Lower Bound on the Weight Hierarchies of Product Codes. 251-261 - Keisuke Shiromoto, Leo Storme
A Griesmer Bound for Linear Codes Over Finite Quasi-Frobenius Rings. 263-274 - Gintaras Skersys:
The Average Dimension of the Hull of Cyclic Codes. 275-292 - Emina Soljanin
Bit-optimal Decoding of Codes Whose Tanner Graphs Are Trees. 293-303 - Horacio Tapia-Recillas, Gerardo Vega:
Some Constacyclic Codes Over Z2k and Binary Quasi-cyclic Codes. 305-316
Volume 128, Number 2-3, June 2003
- Eddie Cheng
Time-stamped Graphs and Their Associated Influence Digraphs. 317-335 - Mauro Dell'Amico
The Base-matroid and Inverse Combinatorial Optimization Problems. 337-353 - Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan:
Recognition of Some Perfectly Orderable Graph Classes. 355-373 - Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann:
A Linear-programming Approach to the Generalized Randic Index. 375-385 - David Hartvigsen:
Characterizing the Flow Equivalent Trees of a Network. 387-394 - Tamás Kis
A Lower Bound for the Job Insertion Problem. 395-419 - Guizhen Liu, Binhai Zhu:
Some Problems on Factorizations with Constraints in Bipartite Graphs. 421-434 - Annalisa Massini:
All-to-all Personalized Communication on Multistage Interconnection Networks. 435-446 - Juan Rada
Randic Structure of a Graph. 447-463 - Peggy Sullivan:
Cut, Paste, Filter. 465-485 - Igor E. Zverovich:
Extension of Hereditary Classes with Substitutions. 487-509 - Christian Blum
Local Search Algorithms for the k-cardinality Tree Problem. 511-540 - Gunnar Brinkmann, Thomas Harmuth, Oliver Heidemeier:
The Construction of Cubic and Quartic Planar Maps with Prescribed Face Degrees. 541-554 - Alison Bailey, Gary Gordon, Matthew Patton, Jennifer Scancella:
Expected Value Expansions in Rooted Graphs. 555-571
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: