Abstract
A binned dirty-paper code (DPC) divides a set of codewords into a number of bins. The codeword in the bin that has the maximum correlation with the side information is selected as the transmitted dirty-paper codeword. This letter derives and verifies the analytical bit-error rate (BER) expression of binned orthogonal block code used as DPC in watermarking applications. The BER trends of such orthogonal DPC under constant code length or constant code rate constrains are analyzed. Finally, we propose a new class of DPC based on binned bi-orthogonal codes and demonstrate its BER performance gain over orthogonal DPC.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
