Binary nonconsecutive one code for time-tag data compression

Abstract

A simple time-tag data-compression scheme which uses a binary nonconsecutive one code is introduced to provide higher data compression ratios than similar schemes which have been suggested. This data-compression scheme should be very easy to implement. In addition, it does not require a priori knowledge of the information source.