A construction of codes with linearity from two linear codes

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 237
  • Download : 0
Let F-p be a finite field, where p is a prime. This paper presents a new construction of a code C over F-p2 from two linear codes over F-p, which has F-p-linearity and its minimum distance is equal to its minimum nonzero weight. Based on our construction, we shall determine the weight enumerators of some codes defined by quadratic bent functions and simplex codes. It will be shown that these codes have a few nonzero weights.
Publisher
SPRINGER
Issue Date
2017-01
Language
English
Article Type
Article
Keywords

PERFECT NONLINEAR FUNCTIONS; SECRET SHARING SCHEMES; CYCLIC CODES; HAMMING WEIGHTS; 3-WEIGHT CODES; DISTRIBUTIONS; 2-WEIGHT; MAPPINGS

Citation

CRYPTOGRAPHY AND COMMUNICATIONS, v.9, no.1, pp.55 - 69

ISSN
1936-2447
DOI
10.1007/s12095-016-0193-6
URI
http://hdl.handle.net/10203/223075
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0