Codes that attain minimum distance in every possible direction

DOI10.2478/S11533-008-0001-4zbMATH Open1140.94020OpenAlexW2025465674MaRDI QIDQ2425557FDOQ2425557

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

Publication date: 6 May 2008

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

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

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

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)

Cites Work

• Title not available (Why is that?)
• Horn clauses and database dependencies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimum matrix representation of closure operations
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on minimal matrix representation of closure operations
• A survey of some combinatorial results concerning functional dependencies in database relations.
• The characterization of branching dependencies
• Design type problems motivated by database theory
• Perfect error-correcting databases
• Keys and Armstrong databases in trees with restructuring
• Counter-free keys and functional dependencies in higher-order datamodels
• Foundations of Information and Knowledge Systems
• Foundations of Information and Knowledge Systems

Cited In (6)

• Note on the size of binary Armstrong codes
• Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001
• SPT(q, k, n)-Codes
• Coding Theory Motivated by Relational Databases
• 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)