www.math.mtu.edu/∼tonchev Abstract — Difference systems of sets can be used to transform an arbitrary linear code to a coset of a linear code with a given comma-free index by means of a minimal increase of its length. The paper discusses some constructions of difference systems of sets obtained from cyclic difference sets and finite geometry. Key Words: code synchronization, difference set, difference system of sets
The study of cyclic difference sets is important in the field of design and coding theory. Many diff...
Abstract — Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal ...
AbstractVarious synchronization primitives are described by adding and testing integer vectors, or b...
AbstractDifference systems of sets (DSS) are combinatorial structures that are a generalization of c...
Difference systems of sets (DSS) are combinatorial configurations that arise in connection with code...
AbstractDifference systems of sets (DSS) are combinatorial configurations that arise in connection w...
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code...
Difference Systems of Sets (DSS) are combinatorial structures that generalize cyclic difference sets...
Difference Systems of Sets (DSS) are combinatorial structures that are used in code synchronization....
AbstractSupplementary difference systems are a generalization of difference sets. We consider such g...
Difference sets are mathematical structures which arise in algebra and combinatorics, with applicati...
Self-synchronization under the presence of additive noise can be achieved by allocating a certain nu...
Self-synchronization under the presence of additive noise can be achieved by allocating a certain nu...
AbstractDifference Systems of Sets (DSS) are combinatorial configurations that arise in connection w...
Abstract—Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal fr...
The study of cyclic difference sets is important in the field of design and coding theory. Many diff...
Abstract — Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal ...
AbstractVarious synchronization primitives are described by adding and testing integer vectors, or b...
AbstractDifference systems of sets (DSS) are combinatorial structures that are a generalization of c...
Difference systems of sets (DSS) are combinatorial configurations that arise in connection with code...
AbstractDifference systems of sets (DSS) are combinatorial configurations that arise in connection w...
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code...
Difference Systems of Sets (DSS) are combinatorial structures that generalize cyclic difference sets...
Difference Systems of Sets (DSS) are combinatorial structures that are used in code synchronization....
AbstractSupplementary difference systems are a generalization of difference sets. We consider such g...
Difference sets are mathematical structures which arise in algebra and combinatorics, with applicati...
Self-synchronization under the presence of additive noise can be achieved by allocating a certain nu...
Self-synchronization under the presence of additive noise can be achieved by allocating a certain nu...
AbstractDifference Systems of Sets (DSS) are combinatorial configurations that arise in connection w...
Abstract—Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal fr...
The study of cyclic difference sets is important in the field of design and coding theory. Many diff...
Abstract — Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal ...
AbstractVarious synchronization primitives are described by adding and testing integer vectors, or b...
Add to ORKG