#### Filter Results:

- Full text PDF available (65)

#### Publication Year

1985

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- B H Marcus, R M Roth, P H Siegel, S Pless, W C Huuman, J K Wolf
- 2000

13 encoded codewords. (C2) The codewords at addresses a and a + 2 8 should have diierent parities (of number of 1's). We use the following heuristic procedure to reorder the table so that these two conditions are satissed. Denote by x; y) a contiguous table portion that starts at address x and ends at address y?1 (inclusive). Starting with s = 000, we look… (More)

- Brian Marcus
- 1995

This article is a summary of the plenary lecture that I gave at the 1995 IEEE International Symposium on Information Theory. The lecture was intended to give a concrete and elementary introduction to the subject of symbolic dynamics. From my point of view, symbolic dynamics is the subject of \coding" from one \constrained set" of sequences to another. Of… (More)

- Brian H. Marcus
- IEEE Trans. Information Theory
- 1985

- Jorge Campello de Souza, Brian H. Marcus, Richard New, Bruce A. Wilson
- IEEE Trans. Information Theory
- 2002

—We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and whose ECC decoding scheme requires easy access to soft information (e.g., turbo codes, low-density parity-check (LDPC) codes or parity codes). We expand on earlier work of Immink… (More)

- Guangyue Han, B. Marcus
- Proceedings. International Symposium on…
- 2005

We prove that under mild assumptions a hidden Markov chain varies analytically, in a strong sense, as a function of the underlying Markov chain parameters. In particular, we show that, under these assumptions, the entropy rate of a hidden Markov chain is an analytic function of the parameters. We give examples to show how this can fail in some cases. And we… (More)

- Guangyue Han, B. Marcus
- 2007 IEEE International Symposium on Information…
- 2007

In this paper, we generalize a result by E. Ordentlich and T. Weissman. (2004) and derive an asymptotic formula for the entropy rate of a hidden Markov chain, observed when a Markov chain passes through a binary symmetric channel. And we prove an asymptotic formula for the capacity of a binary symmetric channel with input process supported on an irreducible… (More)

- Brian H. Marcus, Paul H. Siegel, Jack K. Wolf
- IEEE Journal on Selected Areas in Communications
- 1992

This paper provides a self-contained exposition of k modulation code design methods based upon the state splitting algorithm. The techniques are applied to the design of several codes of interest in digital data recording.

We describe a digital holographic storage system for the study of noise sources and the evaluation of modulation and error-correction codes. A precision zoom lens and Fourier transform optics provide pixel-to-pixel matching between any input spatial light modulator and output CCD array over magnifications from 0.8 to 3. Holograms are angle multiplexed in… (More)

- John L. Fan, Tze-Lei Poo, Brian H. Marcus
- IEEE Transactions on Information Theory
- 2004

In digital storage systems where the input to the noisy channel is required to satisfy a modulation constraint, the constrained code and error-control code (ECC) are typically designed and decoded independently. The achievable rate for this situation is evaluated as the rate of average intersection of the constraint and the ECC. The gap from the capacity of… (More)

- Guangyue Han, Brian H. Marcus
- ArXiv
- 2008

We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set. Motivated by a result of Ordentlich and Weissman [In Proceedings of IEEE Information Theory Workshop (2004) 117–122], we derive an asymptotic formula (when the… (More)