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

DOI10.1016/0020-0190(95)00066-LzbMATH Open0988.94030OpenAlexW2064316896MaRDI QIDQ672019FDOQ672019

Authors: 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

Recommendations

• On partitions of an \(n\)-cube into nonequivalent perfect codes
• On partitions of an \(n\)-cube into perfect binary codes
• On transitive partitions of an \(n\)-cube into codes
• Graphs, designs and codes related to the \(n\)-cube
• Error correcting codes arising from cubes

zbMATH Keywords

Latin squares\(n\)-cubecombinatorial problemsindependent domination numberdistance-three codes

Mathematics Subject Classification ID

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

Cites Work

• Approximating the minimum maximal independence number
• A survey of the theory of hypercube graphs
• Title not available (Why is that?)
• A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• A comment on ``The domination number of exchanged hypercubes
• Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
• Smallest independent dominating sets in Kronecker products of cycles
• On maximal partial Latin hypercubes

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

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