Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
The Existence of MacWilliams-Type Identities for the Lee, Homogeneous and Subfield Metric
by
Bariffi, Jessica
, Weger, Violetta
, Cavicchioni, Giulia
in
Linear programming
2024
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
The Existence of MacWilliams-Type Identities for the Lee, Homogeneous and Subfield Metric
by
Bariffi, Jessica
, Weger, Violetta
, Cavicchioni, Giulia
in
Linear programming
2024
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
The Existence of MacWilliams-Type Identities for the Lee, Homogeneous and Subfield Metric
Paper
The Existence of MacWilliams-Type Identities for the Lee, Homogeneous and Subfield Metric
2024
Request Book From Autostore
and Choose the Collection Method
Overview
Famous results state that the classical MacWilliams identities fail for the Lee metric, the homogeneous metric and for the subfield metric, apart from some trivial cases. In this paper we change the classical idea of enumerating the codewords of the same weight and choose a finer way of partitioning the code that still contains all the information of the weight enumerator of the code. The considered decomposition allows for MacWilliams-type identities which hold for any additive weight over a finite chain ring. For the specific cases of the homogeneous and the subfield metric we then define a coarser partition for which the MacWilliams-type identities still hold. This result shows that one can, in fact, relate the code and the dual code in terms of their weights, even for these metrics. Finally, we derive Linear Programming bounds stemming from the MacWilliams-type identities presented.
Publisher
Cornell University Library, arXiv.org
Subject
This website uses cookies to ensure you get the best experience on our website.