A recursive construction for difference systems of sets (Q2414933): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q129701088, #quickstatements; #temporary_batch_1726262144271 |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10623-018-0505-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2805825787 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hyperplane partitions and difference systems of sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Comma-Free Codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal difference systems of sets and partition-type cyclic difference packings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4063325 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5538955 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5421129 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitions of difference sets and code synchronization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal difference systems of sets and difference sets / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129701088 / rank | |||
Normal rank |
Latest revision as of 22:24, 13 September 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A recursive construction for difference systems of sets |
scientific article |
Statements
A recursive construction for difference systems of sets (English)
0 references
17 May 2019
0 references
Difference systems of sets (DSSs), which can be used for code synchronization, generalize cyclic difference sets. In this paper, recursive constructions for DSSs with composite order are developed, and infinite series of asymptotically optimal DSSs are given.
0 references
difference system of sets
0 references
difference set
0 references
difference covering
0 references
difference packing
0 references
code synchrinization
0 references