default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgebraic Coding 1993: Paris, France
- Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor:
Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings. Lecture Notes in Computer Science 781, Springer 1993, ISBN 3-540-57843-9
Convolutional codes and special channels
- Vladimir B. Balakirsky:
A Necessary and Sufficient Condition for Time-Variant Convolutional Encoders to be Noncatastrophic. 1-10 - Gideon Kaplan, Shlomo Shamai, Yosef Kofman:
On the Design and Selection of Convolutional Codes for a Bursty Rician Channel. 11-21 - Gregory Poltyrev, Jakov Snyders:
MODULO-2 Separable Linear Codes. 22-27 - Volodia Blinovsky, M. Pinsker:
Estimation of the size of the list when decoding over an arbitrarily varying channel. 28-33
Covering codes
- Iiro S. Honkala:
A Lower Bound on Binary Codes with Covering Radius One. 34-37 - E. Kolev, Ivan N. Landgev:
On Some Mixed Covering Codes of Small Length. 38-50 - Antoine Lobstein, Vera Pless:
The Length Function: A Revised Table. 51-55 - Irina E. Bocharova, Boris D. Kudryashov:
On the covering radius of convolutional codes. 56-62
Cryptography
- Olivier Delos, Jean-Jacques Quisquater:
Efficient multi-signature schemes for cooperating entities. 63-74 - David Naccache, David M'Raïhi:
Montgomery-Suitable Cryptosystems. 75-81 - Carlo Blundo, Alfredo De Santis
, Luisa Gargano, Ugo Vaccaro:
Secret Sharing Schemes with Veto Capabilities. 82-89 - Jean-Pierre Tillich, Gilles Zémor:
Group-theoretic hash functions. 90-110
Sequences
- Sara Bitan, Tuvi Etzion:
On Constructions for Optimal Optical Orthogonal Codes. 111-125 - Amnon Gavish, Abraham Lempel:
On Complementary Sequences. 126-140 - Ron M. Roth:
Spectral-Null Codes and Null Spaces of Hadamard Submatrices. 141-153 - Sascha Barg:
On small families of sequences with low periodic correlation. 154-158
Graphs and codes
- Noga Alon, Benny Sudakov:
Disjoint Systems (Extended Abstract). 159-163 - Oscar Moreno, Victor A. Zinoviev:
Some sufficient conditions for 4-regular graphs to have 3-regular subgraphs. 164-171 - Mark G. Karpovsky, Saeed M. Chaudhry, Lev B. Levitin, Claudio Moraga:
Detection and Location of Given Sets of Errors by Nonbinary Linear Codes. 172-193
Sphere packings and lattices
- Alexis Bonnecaze, Patrick Solé:
Quaternary constructions of formally self-dual binary codes and unimodular lattices. 194-205 - Peter G. Boyvalenkov, Svetla Nikova:
New lower bounds for some spherical designs. 207-216 - Gregory Poltyrev:
Lattices Based on Linear Codes. 217-224 - Pierre Loyer, Patrick Solé:
Quantizing and decoding for usual lattices in the LP-metric. 225-235 - Ofer Amrani, Yair Be'ery, Alexander Vardy:
Bounded-Distance Decoding of the Leech Lattice and the Golay Code. 236-248
Bounds for codes
- Sergei I. Kovalov:
Some restrictions on distance distribution of optimal binary codes. 249-252 - Simon Litsyn, Alexander Vardy:
Two new upper bounds for codes of distance 3. 253-262 - Gregory Kabatianskii, Antoine Lobstein:
On Plotkin-Elias Type Bounds for Binary Arithmetic Codes. 263-269 - Gérard D. Cohen, Llorenç Huguet i Rotger, Gilles Zémor:
Bounds on generalized weights. 270-277 - Gilles Zémor:
Threshold effects in codes. 278-286 - Josep Rifà-Coma:
Decoding a bit more than the BCH bound. 287-303 - Nicolas Sendrier:
Product codes and the Singleton bound. 304-315 - Ilya Dumer, Patrick Guy Farrell:
Erasure Correction Performance of Linear Block Codes. 316-326
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-11-15 19:20 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:
