Abstract
Two constructions of a low-complexity near-optimal detection method of dc2-balanced codes are presented. The methods presented are improvements on Slepian's algorithm for optimal detection of permutation codes.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
