Family complexity and VC-Dimension

Authors:
Christian Mauduit;András Sárközy
Affiliations:
Institut de Mathématiques de Luminy, CNRS, UMR 6206, Marseille Cedex 9, France, Instituto de Matemática Pura e Aplicada, IMPA, CNRS, UMI 2924, Rio de Janeiro, RJ, Brasil;Department of Algebra and Number Theory, Eötvös Loránd University, Budapest, Hungary
Venue:
Information Theory, Combinatorics, and Search Theory
Year:
2013

Citing 2
Cited 0

Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Large families of pseudorandom sequences of k symbols and their complexity: part II

General Theory of Information Transfer and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 2003 Ahlswede, Khachatrian, Mauduit and Sárközy introduced the notion of family complexity of binary sequences, and in 2006 Ahlswede, Mauduit and Sárközy extended this definition to sequences of k symbols. Since that several further related papers have been published on this subject. In this paper our main goal is to present a survey of all these papers. We will also answer a question of Csiszár and Gách on the connection of family complexity and VC-dimension.