Boyce-Codd normal form (or BCNF) is a slightly stronger version of the third normal form (3NF).

A table is in Boyce-Codd normal form if and only if, for every one of its dependencies X → Y, X is a superkey