Codes that attain minimum distance in every possible direction

DOI10.2478/S11533-008-0001-4MaRDI QIDQ2425557zbMATH OpenOpenAlexFDO

Authors Attila Sali, Klaus-Dieter Schewe, Gyula O. H. Katona

Publication date 6 May 2008

Published in Central European Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.2478/s11533-008-0001-4

zbMATH Keywords

databasefunctional dependencyError correcting codesextremal problems of codeskey dependency

Mathematics Subject Classification ID

Database theory (68P15) Combinatorial codes (94B25) Bounds on codes (94B65) Extremal combinatorics (05D99)

Recommendations

• SPT(q, k, n)-Codes
• Minimum block length of a linear q-ary code with specified dimension and code distance
• New results on codes with covering radius 1 and minimum distance 2
• On \(q\)-ary codes with two distances \(d\) and \(d+1\)
• On two-weight codes

Cites work

• scientific article; zbMATH DE number 3666227 (Why is no real title available?)
• scientific article; zbMATH DE number 3731387 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 863491 (Why is no real title available?)
• A note on minimal matrix representation of closure operations
• A survey of some combinatorial results concerning functional dependencies in database relations.
• Counter-free keys and functional dependencies in higher-order datamodels
• Design type problems motivated by database theory
• Foundations of Information and Knowledge Systems
• Foundations of Information and Knowledge Systems
• Horn clauses and database dependencies
• Keys and Armstrong databases in trees with restructuring
• Minimum matrix representation of closure operations
• Perfect error-correcting databases
• The characterization of branching dependencies

Cited in

(7)

• Note on the size of binary Armstrong codes
• Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001
• Coding theory motivated by relational databases
• SPT(q, k, n)-Codes
• Optimal codes in the Enomoto-Katona space
• Ideal non-deterministic operators as a formal framework to reduce the key finding problem
• On the Existence of Armstrong Instances with Bounded Domains

This page was built for publication: Codes that attain minimum distance in every possible direction

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