Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Glenn T. Sincerbox

dblp:98/1814 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › optical storage
holographic memory
0.011997
Principles and techniques of optical data storage · Proc. IEEE 1997
Storage systems
optical storage
0.011997
Principles and techniques of optical data storage · Proc. IEEE 1997
Coding theory › error-correcting codes › coded modulation
modulation codes
0.011996
Conservative arrays: multidimensional modulation codes for holographic recording · IEEE Trans. Inf. Theory 1996

Methods — techniques the papers use, named apart from their topics

error-correcting codes · 0.0differential coding · 0.0
YearPublicationVenuePosition
1997 Principles and techniques of optical data storage
abstract
We review the field of optical data storage and describe the various technologies that either are in use today or are likely to play a role in the near future. Our emphasis will be on optical-disk and holographic optical storage.
Masud Mansuripur, Glenn T. Sincerbox
Proc. IEEE2
1996 Conservative arrays: multidimensional modulation codes for holographic recording
abstract
In holographic storage, two-dimensional arrays of binary data is optically recorded in a medium via an interference process. To ensure optimum operation of a holographic recording system, it is desirable that the patterns of 1s (light) and 0s (no light) in the recorded array satisfy the following modulation constraint: in each row and column of the array there are at least t transitions of the type 1/spl rarr/0 or 0/spl rarr/1, for a prescribed integer t. A two-dimensional array with this property is said to be a conservative array of strength t. In general, an n-dimensional conservative array of strength t is a binary array having at least t transitions in each column, extending in any of the n dimensions of the array. We present an algorithm for encoding unconstrained binary data into an n-dimensional conservative array of strength t. The algorithm employs differential coding and error-correcting codes. Using n binary codes-one per dimension-with minimum Hamming distance d/spl ges/2t-3, we apply a certain transformation to an arbitrary information array which ensures that the number of transitions in each dimension is determined by the minimum distance of the corresponding code.
Alexander Vardy, Mario Blaum, Paul H. Siegel, Glenn T. Sincerbox
IEEE Trans. Inf. Theory4