scholarly journals The combinatorics of LCD codes: linear programming bound and orthogonal matrices

2017 ◽  
Vol 4 (2/3) ◽  
pp. 116 ◽  
Author(s):  
Steven T. Dougherty ◽  
Jon Lark Kim ◽  
Buket Ozkaya ◽  
Lin Sok ◽  
Patrick Solé
Keyword(s):  
Linear Programming ◽  
Orthogonal Matrices ◽  
Linear Programming Bound ◽  
Lcd Codes

scholarly journals The combinatorics of LCD codes: linear programming bound and orthogonal matrices

2017 ◽  
Vol 4 (2/3) ◽  
pp. 116
Author(s):  
Lin Sok ◽  
Buket Ozkaya ◽  
Patrick Solé ◽  
Jon Lark Kim ◽  
Steven T. Dougherty
Keyword(s):  
Linear Programming ◽  
Orthogonal Matrices ◽  
Linear Programming Bound ◽  
Lcd Codes

Sharpening the linear programming bound for linear Lee codes

2015 ◽  
Vol 51 (6) ◽  
pp. 492-494 ◽  
Author(s):  
H. Astola ◽  
I. Tabus
Keyword(s):  
Linear Programming ◽  
Linear Programming Bound

Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets

1999 ◽  
Vol 51 (2) ◽  
pp. 326-346 ◽  
Author(s):  
W. J. Martin ◽  
D. R. Stinson
Keyword(s):  
Linear Programming ◽  
Association Scheme ◽  
Type Theorem ◽  
Orthogonal Arrays ◽  
Association Schemes ◽  
Theoretic Approach ◽  
Linear Programming Bound ◽  
Ordered Orthogonal Arrays

AbstractIn an earlier paper [10], we studied a generalized Rao bound for ordered orthogonal arrays and (T, M, S)-nets. In this paper, we extend this to a coding-theoretic approach to ordered orthogonal arrays. Using a certain association scheme, we prove a MacWilliams-type theorem for linear ordered orthogonal arrays and linear ordered codes as well as a linear programming bound for the general case. We include some tables which compare this bound against two previously known bounds for ordered orthogonal arrays. Finally we show that, for even strength, the LP bound is always at least as strong as the generalized Rao bound.

scholarly journals On the linear programming bound for linear Lee codes

SpringerPlus ◽  
2016 ◽  
Vol 5 (1) ◽  
Author(s):  
Helena Astola ◽  
Ioan Tabus
Keyword(s):  
Linear Programming ◽  
Linear Programming Bound

scholarly journals Errata for “The linear programming bound for codes over finite Frobenius rings”

2007 ◽  
Vol 45 (2) ◽  
pp. 269-270
Author(s):  
Eimear Byrne ◽  
Marcus Greferath ◽  
Michael E. O’Sullivan
Keyword(s):  
Linear Programming ◽  
Linear Programming Bound ◽  
Frobenius Rings ◽  
Finite Frobenius Rings
Sign in / Sign up

Export Citation Format

Share Document