Complete weight enumerators of some linear codes and their applications

Recently, linear codes constructed from defining sets have been extensively studied. It was shown that the linear codes may have a few nonzero weights or be optimal if the defining sets are well chosen. The weight enumerators of these linear codes were also presented. In this paper, we investigate the complete weight enumerators of some linear codes constructed from the defining sets. As applications, we employ the explicit complete weight enumerators of the linear codes to construct constant composition codes and systematic authentication codes. A new class of optimal constant composition codes and three classes of asymptotically optimal systematic authentication codes are presented
Publisher
SPRINGER
Issue Date
2016-10
Language
ENG
Keywords

CONSTANT-COMPOSITION CODES; DIFFERENCE BALANCED FUNCTIONS; REDUCIBLE CYCLIC CODES; AUTHENTICATION CODES; PERMUTATION ARRAYS; CONSTRUCTIONS; 3-WEIGHT

Citation

DESIGNS CODES AND CRYPTOGRAPHY, v.81, no.1, pp.153 - 168

ISSN
0925-1022
DOI
10.1007/s10623-015-0136-9
URI
http://hdl.handle.net/10203/213149
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 105
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 5 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0