- Full text PDF available (2)
- This year (2)
- Last 5 years (5)
- Last 10 years (11)
First, we compute the number of non-minimal codewords of weight 2d min in the binary Reed-Muller code RM (r, m). Second, we prove that all codewords of weight greater than 2 m − 2 m−r+1 in binary RM (r, m), are non-minimal.
We compute the number of non-minimal codewords of weight 2d min in the binary Reed-Muller code.
Steganography and Digital Watermarking are concerned with embedding information in digital media such as images, audio signals and video. Both scientific disciplines develop methods for conceal message (a sequence of bits) by modifying the host (cover) digital object but their goals are slightly different. In this work we discuss two methods of information… (More)