Access the full text.
Sign up today, get DeepDyve free for 14 days.
P Delsarte (1973)
10.1016/S0019-9958(73)80007-5Inf. Control, 23
A Haily (2015)
10.1080/09720529.2014.927650J. Discrete Mathemat. Sci. Cryptograph., 18
P Horak (2009)
10.1016/j.disc.2008.03.019Discret. Math., 309
A Lempel (1977)
10.1109/TIT.1977.1055735IEEE Trans. Inf. Theory, 23
M Shi (2020)
10.1109/TIT.2019.2946660IEEE Trans. Inf. Theory, 66
C Qureshi (2020)
10.1016/j.ejc.2019.103022Eur. J. Combinat, 83
M Blaum (1998)
10.1109/18.661516IEEE Trans. Inf. Theory, 44
P Horak (2018)
10.1109/TIT.2017.2786675IEEE Trans. Inf. Theory, 64
SW Golomb (1970)
10.1137/0118025SIAM J. Appl. Math., 18
KA Post (1975)
10.1016/S0019-9958(75)80005-2Inf. Control, 29
TL Alderson (2019)
10.22108/toc.2019.112621.1584Trans. Comb., 8
T Etzion (2011)
10.1109/TIT.2011.2161133IEEE Trans. Inf. Theory, 57
A Jiang (2010)
10.1109/TIT.2010.2043764IEEE Trans. Inf. Theory, 56
TL Alderson (2018)
10.3934/amc.2019006Adv. Math. Commun., 13
J MacWilliams (1963)
10.1002/j.1538-7305.1963.tb04003.xBell Syst. Tech. J., 42
M Shi (2019)
10.1007/s10623-018-0488-zDes. Codes Crypt., 87
R Roth (1994)
10.1109/18.335966IEEE Trans. Inf. Theory, 40
JCY Chiang (1971)
10.1016/S0019-9958(71)90791-1Inf. Control, 19
M Shi (2020)
10.1109/TIT.2020.3001591IEEE Trans. Inf. Theory, 66
R Roth (2006)
10.1017/CBO9780511808968
C Satyanarayana (1979)
10.1109/TIT.1979.1056017IEEE Trans. Inf. Theory, 25
C Araujo (2014)
10.1007/s10623-012-9666-6Int. J., 70
G Cohen (1985)
10.1016/0012-365X(85)90190-6Discret. Math., 56
T Etzion (2013)
10.1109/TIT.2013.2268156IEEE Trans. Inf. Theory, 59
KU Schmidt (2007)
10.1109/TIT.2006.889723IEEE Trans. Inf. Theory, 53
J Astola (1982)
10.1109/TIT.1982.1056550IEEE Trans. Inf. Theory, 28
C Lee (1958)
10.1109/TIT.1958.1057446IRE Trans. Inform. Theory, 4
A Orlitsky (1993)
10.1137/0406043SIAM J. Discret. Math., 6
A combinatorial problem concerning the maximum size of the (Hamming) weight set of an [n,k]q\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$[n,k]_q$$\end{document} linear code was recently introduced. Codes attaining the established upper bound are the Maximum Weight Spectrum (MWS) codes. Those [n,k]q\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$[n,k]_q$$\end{document} codes with the same weight set as Fqn\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\mathbb {F}_q^n$$\end{document} are called Full Weight Spectrum (FWS) codes. FWS codes are necessarily “short”, whereas MWS codes are necessarily “long”. For fixed k, q the values of n for which an [n,k]q\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$[n,k]_q$$\end{document}-FWS code exists are completely determined, but the determination of the minimum length M(H, k, q) of an [n,k]q\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$[n,k]_q$$\end{document}-MWS code remains an open problem. The current work broadens discussion first to general coordinate-wise weight functions, and then specifically to the Lee weight and a Manhattan like weight. In the general case we provide bounds on n for which an FWS code exists, and bounds on n for which an MWS code exists. When specializing to the Lee or to the Manhattan setting we are able to completely determine the parameters of FWS codes. As with the Hamming case, we are able to provide an upper bound on M(L,k,q)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$M({\mathscr {L}},k,q)$$\end{document} (the minimum length of Lee MWS codes), and pose the determination of M(L,k,q)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$M({\mathscr {L}},k,q)$$\end{document} as an open problem. On the other hand, with respect to the Manhattan weight we completely determine the parameters of MWS codes.
Applicable Algebra in Engineering Communication and Computing – Springer Journals
Published: May 19, 2023
Keywords: Linear codes; Lee weight; Manhattan weight; Maximum weight spectrum; Full weight spectrum; 94B05; 05A99
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.