Related Experiment Video
Updated: Mar 23, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
Published on: October 14, 2017
On the linear programming bound for linear Lee codes
1Department of Signal Processing, Tampere University of Technology, 33101 Tampere, Finland.
Abstract:
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 [Formula: see text] on the set of Lee-compositions. We show some useful properties of certain sums of Lee-numbers, which are the eigenvalues of the Lee association scheme, appearing in the linear programming problem of linear Lee codes. Using the additional equality constraints, we formulate the linear programming problem of linear Lee codes in a very compact form, leading to a fast execution, which allows to efficiently compute the bounds for large parameter values of the linear codes.
More Related Videos
Related Concept Videos
Systems of Linear Equations in Two Variables
Linear Equations
Statically Indeterminate Problem Solving
Application of Nonlinear Inequalities
Linearization and Approximation
Introduction to Nonlinear Inequalities

