A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube

DOI10.1016/0020-0190(95)00066-LzbMath0988.94030OpenAlexW2064316896MaRDI QIDQ672019

Pranava K. Jha, Giora Slutzki

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00066-l

zbMATH Keywords

Latin squarescombinatorial problemsindependent domination number\(n\)-cubedistance-three codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Combinatorial codes (94B25)

Related Items

A comment on ``The domination number of exchanged hypercubes ⋮ Smallest independent dominating sets in Kronecker products of cycles ⋮ Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating the minimum maximal independence number
• A survey of the theory of hypercube graphs
• A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES

This page was built for publication: A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube