As we proceed to higher normal forms, the redudancy levels are reduced. At this level, there are very less redundancy present.
If a given relational schema R is in present in BCNF, then it has the following conditions elimninated. The conditions are:
No dependencies should be such that
i) Proper subset of Candidate key -> Non key attribute
ii) Non key attribute-> Non Key attribute
iii) Proper subset of 1 CK -> Proper subset of other CK
Or we can term that every relational schema in Boyce Coded normal form, if each non-trivial functional dependency satisfies the dependency
A->B, in which X is a super key.
If any of the two definitions are followed, we can say that out relational schema is in BCNF.