On maximal partial Latin hypercubes

DOI10.1007/S10623-023-01314-5MaRDI QIDQ6123056zbMATH OpenOpenAlexFDO

Authors Diane Donovan, Michael John Grannell, Emine Şule Yazıcı

Publication date 4 March 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10623-023-01314-5

zbMATH Keywords

codescovering radiusindependent dominating setsLatin hypercubespartial Latin hypercubes

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Bounds on codes (94B65)

Recommendations

• Maximal partial Latin cubes
• On non-extendable partial Latin rectangles
• A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube
• Publication:4862900
• scientific article; zbMATH DE number 5247093

Cites work

• Approximating latin square extensions
• Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
• Coverings by rook domains
• scientific article; zbMATH DE number 426166 (Why is no real title available?)
• scientific article; zbMATH DE number 2234856 (Why is no real title available?)
• Independent domination in graphs: A survey and recent results
• Maximal partial Latin cubes
• New results on codes with covering radius 1 and minimum distance 2
• On codes with given minimum distance and covering radius
• On the interval containing at least one prime number

Cited in

(1)

• On maximal orthogonal partial Latin squares and minimal codes with specified length, minimum distance and covering radius

This page was built for publication: On maximal partial Latin hypercubes

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