Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Delsarte (1972)
Weights of linear codes and strongly regular normed spacesDiscret. Math., 3
R. Calderbank, W. Kantor (1986)
The Geometry of Two‐Weight CodesBulletin of The London Mathematical Society, 18
J. Massey (1999)
Minimal Codewords and Secret Sharing
M Shi, R Wu, Y Liu, P Solé (2017)
Two and three weight codes over $$\mathbb{F}_p+u\mathbb{F}_p$$ F p + u F pCryptogr. Commun., 9
J. Griesmer (1960)
A Bound for Error-Correcting CodesIBM J. Res. Dev., 4
M. Greferath, S. Schmidt (1999)
Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) codeIEEE Trans. Inf. Theory, 45
Jin Yuan, C. Ding (2006)
Secret sharing schemes from three classes of linear codesIEEE Transactions on Information Theory, 52
M Greferath, SE Schmidt (1999)
Gray isometries for finite chain rings and a nonlinear ternary $$(36, 3^{12}, 15)$$ ( 36 , 3 12 , 15 ) codeIEEE Trans. Inf. Theory, 45
(2017)
Two and three weight codes over Fp + uFp
Ziling Heng, Q. Yue (2015)
A class of q-ary linear codes derived from irreducible cyclic codesArXiv, abs/1511.09174
O. Antoine, Berthet
Theory of Error-correcting Codes
(2015)
A class of binary codes with at most three weights
M Shi, Y Liu, P Solé (2016)
Optimal two-weight codes from trace codes over $$\mathbb{F}_2+u\mathbb{F}_2$$ F 2 + u F 2IEEE Commun. Lett., 20
C. Ding, Jin Yuan (2003)
Covering and Secret Sharing with Linear Codes
M Shi, S Zhu, S Yang (2013)
A class of optimal $$p$$ p -ary codes from one-weight codes over $$\mathbb{F}_p[u]/(u^m)$$ F p [ u ] / ( u m )J. Frankl. Inst., 350
Kelan Ding, C. Ding (2015)
A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret SharingIEEE Transactions on Information Theory, 61
C. Ding, J. Yang (2011)
Hamming weights in irreducible cyclic codesDiscret. Math., 313
FJ MacWilliams, NJA Sloane (1977)
The Theory of Error-Correcting Codes
A. Shamir (1979)
How to share a secretCommun. ACM, 22
C. Ding, Chunlei Li, Nian Li, Zhengchun Zhou (2016)
Three-weight cyclic codes and their weight distributionsDiscret. Math., 339
G. Blakley (1899)
Safeguarding cryptographic keys1979 International Workshop on Managing Requirements Knowledge (MARK)
M. Shi, Yan Liu, P. Solé (2017)
Optimal binary codes from trace codes over a non-chain ringDiscret. Appl. Math., 219
A. Ashikhmin, A. Barg (1998)
Minimal Vectors in Linear CodesIEEE Trans. Inf. Theory, 44
M. Shi, Shixin Zhu, Shanlin Yang (2013)
A class of optimal p-ary codes from one-weight codes over Fp[u]/〈um〉J. Frankl. Inst., 350
In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $$R=\mathbb {F}_p+u\mathbb {F}_p+\cdots +u^{k-1}\mathbb {F}_{p},$$ R = F p + u F p + ⋯ + u k - 1 F p , with $$u^k=0,$$ u k = 0 , are constructed that generalize the construction of Shi et al. (IEEE Commun. Lett. 20(12):2346–2349, 2016), which is the special case of $$p=k=2.$$ p = k = 2 . These codes are defined as trace codes. In some cases of their defining sets, they are abelian. Their homogeneous weight distributions are computed by using exponential sums. In particular, in the two-weight case, we give some conditions of optimality of their Gray images by using the Griesmer bound. Their dual homogeneous distance is also given. The codewords of these codes are shown to be minimal for inclusion of supports, a fact favorable to an application to secret sharing schemes.
Bulletin of the Malaysian Mathematical Sciences Society – Springer Journals
Published: Oct 28, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.