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.

Brian M. King

dblp:15/10899 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · none

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

Computer networks · 1 · 1 first-author

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.

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

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding › decoding algorithms
low-complexity decoding
0.012001
Low-complexity maximum-likelihood decoding of shortened enumerative permutation codes for holographic storage · IEEE J. Sel. Areas Commun. 2001
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding
maximum-likelihood decoding
0.012001
Low-complexity maximum-likelihood decoding of shortened enumerative permutation codes for holographic storage · IEEE J. Sel. Areas Commun. 2001
Coding theory › error-correcting codes › combinatorial coding theory
permutation codes
0.012001
Low-complexity maximum-likelihood decoding of shortened enumerative permutation codes for holographic storage · IEEE J. Sel. Areas Commun. 2001
Storage systems › optical storage
holographic memory
0.012001
Low-complexity maximum-likelihood decoding of shortened enumerative permutation codes for holographic storage · IEEE J. Sel. Areas Commun. 2001

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

encoder design · 0.1constant-weight codes · 0.1ML decoder · 0.1
YearPublicationVenuePosition
2001 Low-complexity maximum-likelihood decoding of shortened enumerative permutation codes for holographic storage
abstract
Volume holographic memories (VHM) are page-oriented optical storage systems whose pages commonly contain on the order of one million pixels. Typically, each stored data page is composed of an equal number of binary pixels in either a low-contrast ("off") state or a high-contrast ("on") state. By increasing the number of "off" pixels and decreasing the number of "on" pixels per page, there is an associated gain in VHM system storage capacity. When grayscale pixels are used, a further gain is possible by similarly controlling the fraction of pixels at each gray level. This paper introduces a constant-weight, nonbinary, shortened enumerative permutation modulation block code to produce pages that exploit the proposed capacity advantage. In addition to the code description, we present an encoder and a low-complexity maximum-likelihood (ML) decoder for the shortened permutation code. A proof verifies our claim of ML decoding. Applying this class of code to VHMs predicts a 49% increase in storage capacity when recording modulation coded 3-bit (eight gray level) pixels compared with a VHM using a binary signaling alphabet and equal-probable (unbiased) data.
Brian M. King, Mark A. Neifeld
IEEE J. Sel. Areas Commun.1