Title: | A note on unscrambling address lines |
Authors: | Lu, CC Tsai, SC 資訊科學與工程研究所 Institute of Computer Science and Engineering |
Keywords: | divide-and-conquer;permutation;field programmable gate array (FPGA);algorithms |
Issue Date: | 28-Feb-2003 |
Abstract: | A writer stores some data in memory accessible via address lines. If an adversary permutes the address lines after the writer leaves the message, then how can a reader find the permutation? This is the so-called unscrambling address lines problem of Broder et al. [SODA'99, 1999, pp. 870-871]. By a divide-and-conquer approach, we give a very simple algorithm to recover the permutation. Our method is much easier to understand than Broder et al.'s previous ad hoc solution. (C) 2002 Elsevier Science B.V. All rights reserved. |
URI: | http://dx.doi.org/10.1016/S0020-0190(02)00392-7 http://hdl.handle.net/11536/28084 |
ISSN: | 0020-0190 |
DOI: | 10.1016/S0020-0190(02)00392-7 |
Journal: | INFORMATION PROCESSING LETTERS |
Volume: | 85 |
Issue: | 4 |
Begin Page: | 185 |
End Page: | 189 |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.