Linear codes with few weights from inhomogeneous quadratic functions

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes with few weights are constructed from inhomogeneous quadrat...

Full description

Saved in:
Bibliographic Details
Published inDesigns, codes, and cryptography Vol. 83; no. 3; pp. 691 - 714
Main Authors Tang, Chunming, Xiang, Can, Feng, Keqin
Format Journal Article
LanguageEnglish
Published New York Springer US 01.06.2017
Springer Nature B.V
Subjects
Binary system
Circuits
Codes
Coding and Information Theory
Computer Science
Cryptology
Data Structures and Information Theory
Discrete Mathematics in Computer Science
Information and Communication
Linear codes
Quadratic equations
94B15
Weight distribution
94B35
94A24
Quadratic forms
Linear codes
94A55
Cyclotomic fields
Online AccessGet full text

Cover

More Information
Summary:Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes with few weights are constructed from inhomogeneous quadratic functions over the finite field GF ( p ) , where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions of these linear codes are also determined.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-016-0267-7