Abstract
An efficient method is presented for encoding sparse binary patterns. This method is very simple to implement and performs in a near-optimum way. The sparse pattern is assumed to be a memoryless binary source. This kind of pattern is found in a three-dimensional authentication scheme. In the data compression area, the patterns are usually not memoryless sources. However, when LPC (linear prediction coding) is applied, the resulting error pattern is very close to a memoryless model.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
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 callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
Disclaimer: 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.
