Constructions of almost difference sets from finite fields

Almost difference sets are an interesting subject of combinatorics, and have applications in many areas of engineering such as CDMA communications, error correcting codes and cryptography. The objective of this paper is to present some new constructions of almost difference sets, together with sever...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Designs, codes, and cryptography Ročník 72; číslo 3; s. 581 - 592
Hlavní autoři: Ding, Cunsheng, Pott, Alexander, Wang, Qi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.09.2014
Springer
Témata:
Applied sciences
Circuits
Coding and Information Theory
Coding, codes
Computer Science
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Cryptography
Cryptology
Data Structures and Information Theory
Discrete Mathematics in Computer Science
Exact sciences and technology
Information and Communication
Information, signal and communications theory
Signal and communications theory
Software
Telecommunications and information theory
05B10
Partial difference set
51E30
05B30
Skew Hadamard differences set
Cyclotomy
Difference set
Almost difference set
11T22
94C30
Equivalence relation
Finite field
Code division multiple access
Hadamard transformation
Error correcting code
Cryptography
ISSN:0925-1022, 1573-7586
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Almost difference sets are an interesting subject of combinatorics, and have applications in many areas of engineering such as CDMA communications, error correcting codes and cryptography. The objective of this paper is to present some new constructions of almost difference sets, together with several results on the equivalence relation.
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-012-9789-9