...(for the 1st datablock) is choosen to represent a 0 or an odd blocknr. to represent an 1. For the remaining blocks of the cover file till the end of the code is reached,
an adjacent blocknr. represents the same bit as the previous one and a non-adjacent blocknr. (a block will be skipped) a negated previous bit.
It's necessary to use a partition with enough adjacent free blocks (code length + holes for fragmentation) within a blockgroup, for this algorithm to work correctly.
WARNING: This is experimental software and could cause crashes or data loss!