Constructions of Difference Systems of Sets From Finite Projective Geometry

Difference systems of sets (DSSs) are combinatorial structures introduced by Levenshtein in connection with code synchronization. In this paper, some recursive constructions of DSSs obtained from finite projective geometry are presented. As a consequence, new infinite families of optimal DSSs are ob...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2012-01, Vol.58 (1), p.130-138
Main Authors: FAN, Cui-Ling, LEI, Jian-Guo
Format: Article
Language:English
Subjects:
Applied sciences
Code synchronization
Codes
Combinatorial analysis
Construction
Decision support systems
difference system of sets
Educational institutions
Exact sciences and technology
f -flat
finite projective space
Geometry
Indexes
Information theory
Information, signal and communications theory
Joints
Mathematical analysis
optimal
Optimization
Projective geometry
Recursive
Redundancy
Spread spectrum communication
Synchronization
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Difference systems of sets (DSSs) are combinatorial structures introduced by Levenshtein in connection with code synchronization. In this paper, some recursive constructions of DSSs obtained from finite projective geometry are presented. As a consequence, new infinite families of optimal DSSs are obtained.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2011.2170921