Coding partitions

Coding partitions

Show other versions (1)

Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ''unique decipherability" at the level o...

Full description

Bibliographic Details
Main Authors:	Fabio Burderi, Antonio Restivo
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2007-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/380/pdf

Similar Items

Approximation and inapproximability results on balanced connected partitions of graphs
by: Frédéric Chataigner, et al.
Published: (2007-01-01)

The largest singletons in weighted set partitions and its applications
by: Yidong Sun, et al.
Published: (2011-12-01)

Gray codes avoiding matchings
by: Darko Dimitrov, et al.
Published: (2009-01-01)

Directed figure codes are decidable
by: Michal Kolarz, et al.
Published: (2009-01-01)

Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)

On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)

On quadratic residue codes and hyperelliptic curves
by: David Joyner
Published: (2008-01-01)

On the number of factors in codings of three interval exchange
by: Petr Ambrož, et al.
Published: (2011-11-01)

Secure frameproof codes through biclique covers
by: Hossein Hajiabolhassan, et al.
Published: (2012-12-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)

Cycle transversals in bounded degree graphs
by: Marina Groshaus, et al.
Published: (2011-03-01)

The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01)

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Network
by: Antonio Fernández Anta, et al.
Published: (2011-04-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)

Note on the weighted internal path length of b-ary trees
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''
by: Véronique Bruyère, et al.
Published: (2007-01-01)

A lower bound for approximating the Grundy number
by: Guy Kortsarz
Published: (2007-01-01)

Baire and automata
by: Pierre Simonnet, et al.
Published: (2007-01-01)

FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees
by: Pascale Minet, et al.
Published: (2007-01-01)

On the kth Eigenvalues of Trees with Perfect Matchings
by: An Chang, et al.
Published: (2007-01-01)

On the critical exponent of generalized Thue-Morse words
by: Alexandre B. Massé, et al.
Published: (2007-01-01)

Properties of the extremal infinite smooth words
by: Srečko Brlek, et al.
Published: (2007-01-01)

"Trivializing'' generalizations of some Izergin-Korepin-type determinants
by: Tewodros Amdeberhan, et al.
Published: (2007-01-01)

Waiting time distributions for pattern occurrence in a constrained sequence
by: Valeri T. Stefanov, et al.
Published: (2007-01-01)

Probe split graphs
by: Van Bang Le, et al.
Published: (2007-01-01)

Ambiguity in the m-bonacci numeration system
by: Petra Kocábová, et al.
Published: (2007-01-01)

Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation
by: Philippe Dumas, et al.
Published: (2007-01-01)

Arithmetics in β-numeration
by: Julien Bernat
Published: (2007-01-01)

Complexity results on graphs with few cliques
by: Bill Rosgen, et al.
Published: (2007-01-01)

A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations
by: Guy Louchard, et al.
Published: (2007-01-01)

Addition and multiplication of beta-expansions in generalized Tribonacci base
by: Petr Ambrož, et al.
Published: (2007-01-01)

Exponential bounds and tails for additive random recursive sequences
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

A geometrical approach of palindromic factors of standard billiard words
by: Jean-Pierre Borel
Published: (2007-01-01)

Computation of L_⊕ for several cubic Pisot numbers
by: Julien Bernat
Published: (2007-01-01)

On the complexity of the balanced vertex ordering problem
by: Jan Kára, et al.
Published: (2007-01-01)

Regular languages and associative language descriptions
by: Marcella Anselmo, et al.
Published: (2007-01-01)

Tribes of cubic partial cubes
by: Sandi Klavžar, et al.
Published: (2007-01-01)

A perimeter enumeration of column-convex polyominoes
by: Svjetlan Feretić
Published: (2007-01-01)

The \v Cerný conjecture for aperiodic automata
by: A. N. Trahtman
Published: (2007-01-01)

Latin square Thue-Morse sequences are overlap-free
by: C. Robinson Tompkins
Published: (2007-01-01)