Conferences in DBLP
Vladimir B. Balakirsky A Necessary and Sufficient Condition for Time-Variant Convolutional Encoders to be Noncatastrophic. [Citation Graph (0, 0)][DBLP ] Conf ] Gideon Kaplan , Shlomo Shamai , Yosef Kofman On the Design and Selection of Convolutional Codes for a Bursty Rician Channel. [Citation Graph (0, 0)][DBLP ] Conf ] Gregory Poltyrev , Jakov Snyders MODULO-2 Separable Linear Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Volodia Blinovsky , M. Pinsker Estimation of the size of the list when decoding over an arbitrarily varying channel. [Citation Graph (0, 0)][DBLP ] Conf ] Iiro S. Honkala A Lower Bound on Binary Codes with Covering Radius One. [Citation Graph (0, 0)][DBLP ] Conf ] E. Kolev , Ivan N. Landgev On Some Mixed Covering Codes of Small Length. [Citation Graph (0, 0)][DBLP ] Conf ] Antoine Lobstein , Vera Pless The Length Function: A Revised Table. [Citation Graph (0, 0)][DBLP ] Conf ] Irina E. Bocharova , Boris D. Kudryashov On the covering radius of convolutional codes. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Delos , Jean-Jacques Quisquater Efficient multi-signature schemes for cooperating entities. [Citation Graph (0, 0)][DBLP ] Conf ] David Naccache , David M'Raïhi Montgomery-Suitable Cryptosystems. [Citation Graph (0, 0)][DBLP ] Conf ] Carlo Blundo , Alfredo De Santis , Luisa Gargano , Ugo Vaccaro Secret Sharing Schemes with Veto Capabilities. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Pierre Tillich , Gilles Zémor Group-theoretic hash functions. [Citation Graph (0, 0)][DBLP ] Conf ] Sara Bitan , Tuvi Etzion On Constructions for Optimal Optical Orthogonal Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Amnon Gavish , Abraham Lempel On Complementary Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Ron M. Roth Spectral-Null Codes and Null Spaces of Hadamard Submatrices. [Citation Graph (0, 0)][DBLP ] Conf ] Sascha Barg On small families of sequences with low periodic correlation. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Benny Sudakov Disjoint Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Oscar Moreno , Victor Zinoviev Some sufficient conditions for 4-regular graphs to have 3-regular subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Mark G. Karpovsky , Saeed M. Chaudhry , Lev B. Levitin , Claudio Moraga Detection and Location of Given Sets of Errors by Nonbinary Linear Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Alexis Bonnecaze , Patrick Solé Quaternary constructions of formally self-dual binary codes and unimodular lattices. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Boyvalenkov , Svetla Nikova New lower bounds for some spherical designs. [Citation Graph (0, 0)][DBLP ] Conf ] Gregory Poltyrev Lattices Based on Linear Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Loyer , Patrick Solé Quantizing and decoding for usual lattices in the LP -metric. [Citation Graph (0, 0)][DBLP ] Conf ] Ofer Amrani , Yair Be'ery , Alexander Vardy Bounded-Distance Decoding of the Leech Lattice and the Golay Code. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei I. Kovalov Some restrictions on distance distribution of optimal binary codes. [Citation Graph (0, 0)][DBLP ] Conf ] Simon Litsyn , Alexander Vardy Two new upper bounds for codes of distance 3. [Citation Graph (0, 0)][DBLP ] Conf ] Gregory Kabatianskii , Antoine Lobstein On Plotkin-Elias Type Bounds for Binary Arithmetic Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Gérard D. Cohen , Llorenç Huguet i Rotger , Gilles Zémor Bounds on generalized weights. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Zémor Threshold effects in codes. [Citation Graph (0, 0)][DBLP ] Conf ] Josep Rifà-Coma Decoding a bit more than the BCH bound. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Sendrier Product codes and the Singleton bound. [Citation Graph (0, 0)][DBLP ] Conf ] Ilya Dumer , Patrick G. Farrell Erasure Correction Performance of Linear Block Codes. [Citation Graph (0, 0)][DBLP ] Conf ] 