scientific article; zbMATH DE number 1123782

MaRDI QIDQ4379736zbMATH OpenFDO

Authors K. S. Gopalakrishnan, Jürgen Bierbrauer, D. R. Stinson

Publication date 4 March 1998

zbMATH Keywords

codesdualityorthogonal arrays

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Linear programming (90C05)

Recommendations

• Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
• Linear programming bounds for doubly-even self-dual codes
• The linear programming bound for binary linear codes
• Bounds on ordered codes and orthogonal arrays
• The combinatorics of LCD codes: linear programming bound and orthogonal matrices
• Linear programming bounds for codes in grassmannian spaces
• Linear programming bounds for codes via a covering argument
• A linear programming bound for orthogonal arrays with mixed levels
• Spectral approach to linear programming bounds on codes
• Linear programming bounds for unitary codes

Cited in

(3)

• A linear programming bound for orthogonal arrays with mixed levels
• Linear programming bounds for balanced arrays
• On a necessary condition for L-step orthogonalization of linear codes and its applications

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4379736)