default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrian H. Marcus
Person information
- affiliation: University of British Columbia, Vancouver, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j37]Chengyu Wu
, Guangyue Han, Venkat Anantharam, Brian H. Marcus:
A Deterministic Algorithm for the Capacity of Finite-State Channels. IEEE Trans. Inf. Theory 68(3): 1465-1479 (2022)
2010 – 2019
- 2019
- [c12]Chengyu Wu, Guangyue Han, Brian H. Marcus:
A Deterministic Algorithm for the Capacity of Finite-State Channels. ISIT 2019: 1897-1901 - [i9]Chengyu Wu, Guangyue Han, Brian H. Marcus:
A Deterministic Algorithm for the Capacity of Finite-State Channels. CoRR abs/1901.02678 (2019) - 2015
- [j36]Guangyue Han, Brian H. Marcus:
Analyticity of Entropy Rate of Hidden Markov Chains With Continuous Alphabet. IEEE Trans. Inf. Theory 61(6): 3013-3028 (2015) - 2014
- [c11]Brian H. Marcus:
Capacity of Higher-Dimensional Constrained Systems. ICMCTA 2014: 3-21 - 2013
- [j35]Brian H. Marcus, Ronnie Pavlov:
Computing Bounds for Entropy of Stationary Zd Markov Random Fields. SIAM J. Discret. Math. 27(3): 1544-1558 (2013) - 2012
- [j34]Guangyue Han, Brian H. Marcus:
Concavity of the Mutual Information Rate for Input-Restricted Memoryless Channels at High SNR. IEEE Trans. Inf. Theory 58(3): 1534-1548 (2012) - [i8]Guangyue Han, Brian H. Marcus:
Analyticity of Entropy Rate of Continuous-State Hidden Markov Chains. CoRR abs/1208.3261 (2012) - 2010
- [j33]Guangyue Han, Brian H. Marcus:
Asymptotics of entropy rate in special families of hidden Markov chains. IEEE Trans. Inf. Theory 56(3): 1287-1295 (2010) - [j32]Erez Louidor, Brian H. Marcus:
Improved lower bounds on capacities of symmetric 2D constraints using Rayleigh quotients. IEEE Trans. Inf. Theory 56(4): 1624-1639 (2010) - [c10]Guangyue Han, Brian H. Marcus:
Entropy rate of continuous-state hidden Markov chains. ISIT 2010: 1468-1472 - [i7]Guangyue Han, Brian H. Marcus:
Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR. CoRR abs/1007.4604 (2010)
2000 – 2009
- 2009
- [c9]Erez Louidor, Brian H. Marcus:
Improved lower bounds on capacities of symmetric 2-dimensional constraints ising Rayleigh quotients. ISIT 2009: 1045-1049 - [c8]Guangyue Han, Brian H. Marcus:
Concavity of mutual information rate for input-restricted finite-state memoryless channels at high SNR. ISIT 2009: 1654-1658 - [r1]Brian H. Marcus:
Symbolic Dynamics. Encyclopedia of Complexity and Systems Science 2009: 8888-8910 - [i6]Erez Louidor, Brian H. Marcus:
Improved Lower Bounds on Capacities of Symmetric 2-Dimensional Constraints using Rayleigh Quotients. CoRR abs/0903.1716 (2009) - [i5]Guangyue Han, Brian H. Marcus, Yuval Peres:
A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes. CoRR abs/0905.2479 (2009) - 2008
- [j31]Brian H. Marcus, Susan Williams:
Symbolic dynamics. Scholarpedia 3(11): 2923 (2008) - [c7]Erez Louidor, Tze-Lei Poo, Panu Chaichanavong, Brian H. Marcus:
Maximum insertion rate and capacity of multidimensional constraints. ISIT 2008: 1458-1462 - [c6]Guangyue Han, Brian H. Marcus:
Asymptotics of entropy rate of hidden Markov chains at weak Black Holes. ISIT 2008: 2629-2633 - [i4]Guangyue Han, Brian H. Marcus:
Asymptotics of Input-Constrained Binary Symmetric Channel Capacity. CoRR abs/0803.3360 (2008) - [i3]Guangyue Han, Brian H. Marcus:
Asymptotics of Entropy Rate in Special Families of Hidden Markov Chains. CoRR abs/0810.2144 (2008) - 2007
- [j30]Guangyue Han, Brian H. Marcus:
Derivatives of Entropy Rate in Special Families of Hidden Markov Chains. IEEE Trans. Inf. Theory 53(7): 2642-2652 (2007) - [c5]Guangyue Han, Brian H. Marcus:
Asymptotics of Noisy Constrained Channel Capacity. ISIT 2007: 991-995 - 2006
- [j29]Tze-Lei Poo, Panu Chaichanavong, Brian H. Marcus:
Tradeoff functions for constrained systems with unconstrained positions. IEEE Trans. Inf. Theory 52(4): 1425-1449 (2006) - [j28]Tze-Lei Poo, Brian H. Marcus:
Time-Varying Maximum Transition Run Constraints. IEEE Trans. Inf. Theory 52(10): 4464-4480 (2006) - [j27]Guangyue Han, Brian H. Marcus:
Analyticity of Entropy Rate of Hidden Markov Chains. IEEE Trans. Inf. Theory 52(12): 5251-5266 (2006) - [c4]Guangyue Han, Brian H. Marcus:
Analyticity of Entropy Rate in Families of Hidden Markov Chains (II). ISIT 2006: 103-107 - [i2]Guangyue Han, Brian H. Marcus:
Derivatives of Entropy Rate in Special Families of Hidden Markov Chains. CoRR abs/cs/0603059 (2006) - 2005
- [j26]Panu Chaichanavong, Brian H. Marcus:
Stabilization of Block-Type-Decodability Properties for Constrained Systems. SIAM J. Discret. Math. 19(2): 321-344 (2005) - [c3]Tze-Lei Poo, Brian H. Marcus:
Time-varying maximum transition run constraints. ISIT 2005: 1468-1472 - [c2]Guangyue Han, Brian H. Marcus:
Analyticity of entropy rate in families of hidden markov chains. ISIT 2005: 2193-2197 - [i1]Guangyue Han, Brian H. Marcus:
Analyticity of Entropy Rate of Hidden Markov Chains. CoRR abs/math/0507235 (2005) - 2004
- [j25]John L. Fan, Tze-Lei Poo, Brian H. Marcus:
Constraint Gain. IEEE Trans. Inf. Theory 50(9): 1989-2001 (2004) - [c1]Tze-Lei Poo, Panu Chaichanavong, Brian H. Marcus:
Tradeoff functions for constrained systems with unconstrained positions. ISIT 2004: 192 - 2003
- [j24]Panu Chaichanavong, Brian H. Marcus:
Optimal block-type-decodable encoders for constrained systems. IEEE Trans. Inf. Theory 49(5): 1231-1250 (2003) - 2002
- [j23]Jorge Campello de Souza, Brian H. Marcus, Richard New, Bruce A. Wilson:
Constrained systems with unconstrained positions. IEEE Trans. Inf. Theory 48(4): 866-879 (2002) - 2001
- [j22]Dharmendra S. Modha, Brian H. Marcus:
Art of constructing low-complexity encoders/decoders for constrained block codes. IEEE J. Sel. Areas Commun. 19(4): 589-601 (2001) - [j21]Roy D. Cideciyan, Evangelos Eleftheriou, Brian H. Marcus, Dharmendra S. Modha:
Maximum transition run codes for generalized partial response channels. IEEE J. Sel. Areas Commun. 19(4): 619-634 (2001) - 2000
- [j20]Jonathan J. Ashley, Maria-Pilar Bernal, Geoffrey W. Burr, Hans Coufal, Harald Guenther, John A. Hoffnagle, C. Michael Jefferson, Brian H. Marcus, Roger M. Macfarlane, Robert M. Shelby, Glenn T. Sincerbox:
Holographic data storage technology. IBM J. Res. Dev. 44(3): 341-368 (2000) - [j19]John L. Fan, Brian H. Marcus, Ron M. Roth:
Lossless sliding-block compression of constrained systems. IEEE Trans. Inf. Theory 46(2): 624-633 (2000) - [j18]Jonathan J. Ashley, Brian H. Marcus:
Time-varying encoders for constrained systems: An approach to limiting error propagation. IEEE Trans. Inf. Theory 46(3): 1038-1043 (2000)
1990 – 1999
- 1998
- [j17]Jonathan J. Ashley, Brian H. Marcus:
Two-dimensional low-pass filtering codes. IEEE Trans. Commun. 46(6): 724-727 (1998) - 1997
- [j16]Jonathan J. Ashley, Brian H. Marcus:
A generalized state-splitting algorithm. IEEE Trans. Inf. Theory 43(4): 1326-1338 (1997) - 1996
- [j15]Joan Feigenbaum, G. David Forney Jr., Brian H. Marcus, Robert J. McEliece, Alexander Vardy:
Introduction to the special issue on codes and complexity. IEEE Trans. Inf. Theory 42(6): 1649-1659 (1996) - [j14]Jonathan J. Ashley, Brian H. Marcus, Ron M. Roth:
On the decoding delay of encoders for input-constrained channels. IEEE Trans. Inf. Theory 42(6): 1948-1956 (1996) - 1995
- [j13]Jonathan J. Ashley, Brian H. Marcus:
Canonical Encoders for Sliding Block Decoders. SIAM J. Discret. Math. 8(4): 555-605 (1995) - [j12]Jonathan J. Ashley, Brian H. Marcus, Ron M. Roth:
Construction of encoders with small decoding look-ahead for input-constrained channels. IEEE Trans. Inf. Theory 41(1): 55-76 (1995) - 1994
- [j11]Natasa Jonoska, Brian H. Marcus:
Minimal presentations for irreducible sofic shifts. IEEE Trans. Inf. Theory 40(6): 1818-1825 (1994) - 1993
- [j10]Jonathan J. Ashley, Brian H. Marcus, Dominique Perrin, Selim Tuncel:
Surjective Extensions of Sliding-Block Codes. SIAM J. Discret. Math. 6(4): 582-611 (1993) - 1992
- [j9]Brian H. Marcus, Paul H. Siegel, Jack K. Wolf:
Finite-State Modulation Codes for Data Storage. IEEE J. Sel. Areas Commun. 10(1): 5-37 (1992) - [j8]Brian H. Marcus, Ron M. Roth:
Improved Gilbert-Varshamov bound for constrained systems. IEEE Trans. Inf. Theory 38(4): 1213-1221 (1992) - [j7]Paul H. Algoet, Brian H. Marcus:
Large deviation theorems for empirical types of Markov chains constrained to thin sets. IEEE Trans. Inf. Theory 38(4): 1276-1291 (1992) - 1991
- [j6]Brian H. Marcus, Ron M. Roth:
Bounds on the number of states in encoder graphs for input-constrained channels. IEEE Trans. Inf. Theory 37(3): 742-758 (1991) - [j5]Chris Heegard, Brian H. Marcus, Paul H. Siegel:
Variable-length state splitting with applications to average runlength-constrained (ARC) codes. IEEE Trans. Inf. Theory 37(3): 759-777 (1991)
1980 – 1989
- 1988
- [j4]Razmik Karabed, Brian H. Marcus:
Sliding-block coding for input-restricted channels. IEEE Trans. Inf. Theory 34(1): 2-26 (1988) - 1987
- [j3]Brian H. Marcus, Paul H. Siegel:
On codes with spectral nulls at rational submultiples of the symbol frequency. IEEE Trans. Inf. Theory 33(4): 557-568 (1987) - 1986
- [j2]Roy L. Adler, Joel Friedman, Bruce Kitchens, Brian H. Marcus:
State splitting for variable-length graphs. IEEE Trans. Inf. Theory 32(1): 108-113 (1986) - 1985
- [j1]Brian H. Marcus:
Sofic systems and encoding data. IEEE Trans. Inf. Theory 31(3): 366-377 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
