The application of coding theory to the design of combinatorial filing schemes of any order

DOI10.1016/0020-0255(83)90031-2zbMath0541.68076OpenAlexW2024301794MaRDI QIDQ794455

Lois Wright Hawkes

Publication date: 1983

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(83)90031-2

zbMATH Keywords

storage and retrieval algorithmsbalanced multiple-valued filing scheme

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Order-(t − 1) balanced multiple-valued filing scheme using difference vectors
• The application of difference sets to the design of a balanced multiple-valued filing scheme
• Application of Finite Geometry in File Organization for Records with Multiple-Valued Attributes
• File organization schemes based on finite geometries
• The Design of Combinatorial Information Retrieval Systems for Files with Multiple-Valued Attributes
• Combinatorial Information Retrieval Systems for Files
• Design of a balanced multiple-valued filing scheme of order two based on cyclically generated spread in finite projective geometry

This page was built for publication: The application of coding theory to the design of combinatorial filing schemes of any order