MWS and FWS Codes for Coordinate-Wise Weight Functions
Tim Alderson, Benjamin Morine

TL;DR
This paper extends the study of weight spectrum codes to general coordinate-wise weights, providing bounds and exact parameters for FWS and MWS codes under Lee and Manhattan weights, and posing open problems for minimum lengths.
Contribution
It generalizes weight spectrum code analysis to coordinate-wise weights and fully characterizes FWS and MWS codes for Lee and Manhattan weights, including bounds and exact parameters.
Findings
Bounds on lengths for FWS and MWS codes under general weights
Complete parameter determination for FWS and MWS codes with Manhattan weight
Open problem posed for minimum length of Lee MWS codes
Abstract
A combinatorial problem concerning the maximum size of the (hamming) weight set of an linear code was recently introduced. Codes attaining the established upper bound are the Maximum Weight Spectrum (MWS) codes. Those codes with the same weight set as are called Full Weight Spectrum (FWS) codes. FWS codes are necessarily ``short", whereas MWS codes are necessarily ``long". For fixed the values of for which an -FWS code exists are completely determined, but the determination of the minimum length of an -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 for which an FWS code exists, and bounds on for which an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Advanced Wireless Communication Techniques
