Issue No.06 - November (1981 vol.7)
In this paper, a recursive data structure is defined which permits a data item of-unlimited length to be represented in a computer memory. The encoded data are a linear string of symbols which contains a specification of the length of the data item and the data item itself. In a single forward scan of the encoded data string, the length of the data item can be determined and the data item located and/or extracted.
variable length data, Coding unbounded numbers, infinite address space, recursive data structure, storing data in a computer memory, unbounded address space, unbounded linear list, unlimited length data format, unlimited length data item, unlimited length data string
R.L. Baber, "A Method for Representing Data Items of Unlimited Length in a Computer Memory", IEEE Transactions on Software Engineering, vol.7, no. 6, pp. 590-593, November 1981, doi:10.1109/TSE.1981.226470