Cargando…
On the linear programming bound for linear Lee codes
Based on an invariance-type property of the Lee-compositions of a linear Lee code, additional equality constraints can be introduced to the linear programming problem of linear Lee codes. In this paper, we formulate this property in terms of an action of the multiplicative group of the field [Formul...
Autores principales: | Astola, Helena, Tabus, Ioan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4771693/ https://www.ncbi.nlm.nih.gov/pubmed/27026939 http://dx.doi.org/10.1186/s40064-016-1863-8 |
Ejemplares similares
-
Inference of Gene Regulatory Networks Based on a Universal Minimum Description Length
por: Dougherty, John, et al.
Publicado: (2008) -
Obituary: Professor Paul Dan Cristea
por: Tabus, Ioan, et al.
Publicado: (2013) -
Public-Key Cryptosystems and Bounded Distance Decoding of Linear Codes
por: Çalkavur, Selda
Publicado: (2022) -
Nonasymptotic Upper Bounds on Binary Single Deletion Codes via Mixed Integer Linear Programming
por: No, Albert
Publicado: (2019) -
Spectral theory of bounded linear operators
por: Kubrusly, Carlos S
Publicado: (2020)