default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascal O. Vontobel
Person information
- affiliation: The Chinese University of Hong Kong
- affiliation: Hewlett Packard Development Company
SPARQL queries 
🛈 Please note that only 63% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j25]Yuwen Huang
, Navin Kashyap, Pascal O. Vontobel:
Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-Negative Matrix. IEEE Trans. Inf. Theory 70(7): 5289-5308 (2024)- [c54]Yuwen Huang, Pascal O. Vontobel:
The Bethe Partition Function and the SPA for Factor Graphs based on Homogeneous Real Stable Polynomials. ISIT 2024: 3029-3034 - 2023
- [j24]Aria Nouri, Reza Asvadi, Jun Chen, Pascal O. Vontobel:
Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels. IEEE Trans. Commun. 71(6): 3301-3316 (2023) - [c53]Yuwen Huang, Pascal O. Vontobel:
Bounding the Permanent of a Non-negative Matrix via its Degree- M Bethe and Sinkhorn Permanents. ISIT 2023: 2774-2779 - [i47]Yuwen Huang, Pascal O. Vontobel:
Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-negative Matrix. CoRR abs/2306.02280 (2023) - 2022
- [c52]Haiwen Cao, Pascal O. Vontobel:
Sparse Regression Codes for MIMO Detection. ITW 2022: 261-266 - [c51]Yuwen Huang, Pascal O. Vontobel:
On the Relationship Between the Minimum of the Bethe Free Energy Function of a Factor Graph and Sum-Product Algorithm Fixed Points. ITW 2022: 666-671 - [c50]Kit Shing Ng, Pascal O. Vontobel:
Double-Cover-Based Analysis of the Bethe Permanent of Non-negative Matrices. ITW 2022: 672-677 - [i46]Kit Shing Ng, Pascal O. Vontobel:
Double-cover-based analysis of the Bethe permanent of non-negative matrices. CoRR abs/2205.15186 (2022) - 2021
- [j23]Haiwen Cao, Pascal O. Vontobel:
Using List Decoding to Improve the Finite-Length Performance of Sparse Regression Codes. IEEE Trans. Commun. 69(7): 4282-4293 (2021) - [c49]Yuwen Huang, Pascal O. Vontobel:
Sets of Marginals and Pearson-Correlation-based CHSH Inequalities for a Two-Qubit System. ISIT 2021: 1338-1343 - [c48]July X. Li, Joseph M. Renes, Pascal O. Vontobel:
Pseudocodeword-based Decoding of Quantum Color Codes. ISIT 2021: 1558-1563 - [c47]Aria Nouri, Reza Asvadi, Jun Chen, Pascal O. Vontobel:
Finite-Input Intersymbol Interference Wiretap Channels. ITW 2021: 1-6 - [i45]Aria Nouri, Reza Asvadi, Jun Chen, Pascal O. Vontobel:
Constrained Secrecy Capacity of Partial-Response Wiretap Channels. CoRR abs/2102.04941 (2021) - [i44]Yuwen Huang, Pascal O. Vontobel:
Sets of Marginals and Pearson-Correlation-based CHSH Inequalities for a Two-Qubit System. CoRR abs/2107.01816 (2021) - 2020
- [j22]Hans-Andrea Loeliger, Pascal O. Vontobel:
Quantum Measurement as Marginalization and Nested Quantum Systems. IEEE Trans. Inf. Theory 66(6): 3485-3499 (2020) - [j21]Michael X. Cao, Pascal O. Vontobel:
Bounding and Estimating the Classical Information Rate of Quantum Channels With Memory. IEEE Trans. Inf. Theory 66(9): 5601-5619 (2020) - [c46]Yuwen Huang, Pascal O. Vontobel:
Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph Covers. ISIT 2020: 1331-1336 - [c45]Haiwen Cao, Pascal O. Vontobel:
Using List Decoding to Improve the Finite-Length Performance of Sparse Regression Codes. ITW 2020: 1-5 - [c44]Shashank Vatedka, Pascal O. Vontobel:
Modified Bethe Permanent of a Nonnegative Matrix. SPCOM 2020: 1-5 - [i43]July X. Li, Joseph M. Renes, Pascal O. Vontobel:
Pseudocodeword-based Decoding of Quantum Color Codes. CoRR abs/2010.10845 (2020) - [i42]Haiwen Cao, Pascal O. Vontobel:
Using List Decoding to Improve the Finite-Length Performance of Sparse Regression Codes. CoRR abs/2011.00224 (2020)
2010 – 2019
- 2019
- [c43]Michael X. Cao, Pascal O. Vontobel:
Optimizing Bounds on the Classical Information Rate of Quantum Channels with Memory. ISIT 2019: 265-269 - [c42]Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel:
Universally Decodable Matrices for Distributed Matrix-Vector Multiplication. ISIT 2019: 1777-1781 - [c41]July X. Li, Pascal O. Vontobel:
Pseudocodeword-based Decoding of Quantum Stabilizer Codes. ISIT 2019: 2888-2892 - [i41]Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel:
Universally Decodable Matrices for Distributed Matrix-Vector Multiplication. CoRR abs/1901.10674 (2019) - [i40]Hans-Andrea Loeliger, Pascal O. Vontobel:
Quantum Measurement as Marginalization and Nested Quantum Systems. CoRR abs/1902.03607 (2019) - [i39]Michael X. Cao, Pascal O. Vontobel:
Bounding and Estimating the Classical Information Rate of Quantum Channels with Memory. CoRR abs/1903.00199 (2019) - [i38]July X. Li, Pascal O. Vontobel:
Pseudocodeword-based Decoding of Quantum Stabilizer Codes. CoRR abs/1903.01202 (2019) - 2018
- [j20]Ali Al-Bashabsheh, Pascal O. Vontobel:
A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers-Wannier Duality. IEEE Trans. Inf. Theory 64(12): 7488-7510 (2018) - [c40]July X. Li, Pascal O. Vontobel:
LP Decoding of Quantum Stabilizer Codes. ISIT 2018: 1306-1310 - 2017
- [j19]Hans-Andrea Loeliger, Pascal O. Vontobel:
Factor Graphs for Quantum Probabilities. IEEE Trans. Inf. Theory 63(9): 5642-5665 (2017) - [j18]Moshe Schwartz, Pascal O. Vontobel:
Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric. IEEE Trans. Inf. Theory 63(10): 6227-6239 (2017) - [c39]Michael X. Cao, Pascal O. Vontobel:
Estimating the information rate of a channel with classical input and output and a quantum state. ISIT 2017: 3205-3209 - [c38]Michael X. Cao, Pascal O. Vontobel:
Double-edge factor graphs: Definition, properties, and examples. ITW 2017: 136-140 - [i37]Michael X. Cao, Pascal O. Vontobel:
Estimating the Information Rate of a Channel with Classical Input and Output and a Quantum State (Extended Version). CoRR abs/1705.01041 (2017) - [i36]Michael X. Cao, Pascal O. Vontobel:
Double-Edge Factor Graphs: Definition, Properties, and Examples. CoRR abs/1706.00752 (2017) - 2016
- [c37]July X. Li, Pascal O. Vontobel:
Factor-graph representations of stabilizer quantum codes. Allerton 2016: 1046-1053 - [c36]Shashank Vatedka, Pascal O. Vontobel:
Pattern maximum likelihood estimation of finite-state discrete-time Markov chains. ISIT 2016: 2094-2098 - [c35]Michael X. Cao, Pascal O. Vontobel:
Quantum factor graphs: Closing-the-box operation and variational approaches. ISITA 2016: 651-655 - [i35]Pascal O. Vontobel:
Analysis of Double Covers of Factor Graphs. CoRR abs/1607.01124 (2016) - [i34]Ali Al-Bashabsheh, Pascal O. Vontobel:
Kramers-Wannier Duality and Factor Graphs. CoRR abs/1607.02361 (2016) - [i33]Moshe Schwartz, Pascal O. Vontobel:
Improved Lower Bounds on the Size of Balls over Permutations with the Infinity Metric. CoRR abs/1609.05277 (2016) - 2015
- [c34]Moshe Schwartz, Pascal O. Vontobel:
Bounds on the size of balls over permutations with the infinity metric. ISIT 2015: 1731-1735 - [c33]Chun Lam Chan, Mahdi Jafari Siavoshani, Sidharth Jaggi, Navin Kashyap, Pascal O. Vontobel:
Generalized belief propagation for estimating the partition function of the 2D Ising model. ISIT 2015: 2261-2265 - [c32]Ali Al-Bashabsheh, Pascal O. Vontobel:
The ising model: Kramers-Wannier duality and normal factor graphs. ISIT 2015: 2266-2270 - [i32]Hans-Andrea Loeliger, Pascal O. Vontobel:
Factor Graphs for Quantum Probabilities. CoRR abs/1508.00689 (2015) - 2014
- [j17]Ron M. Roth, Pascal O. Vontobel:
Coding for Combined Block-Symbol Error Correction. IEEE Trans. Inf. Theory 60(5): 2697-2713 (2014) - [c31]Pascal O. Vontobel:
Counting balanced sequencesw/o forbidden patterns via the betheapproximation and loop calculus. ISIT 2014: 1608-1612 - [c30]Pascal O. Vontobel:
The Bethe and Sinkhorn approximations of the pattern maximum likelihood estimate and their connections to the Valiant-Valiant estimate. ITA 2014: 1-10 - 2013
- [j16]Mayur Punekar, Pascal O. Vontobel, Mark F. Flanagan:
Low-Complexity LP Decoding of Nonbinary Linear Codes. IEEE Trans. Commun. 61(8): 3073-3085 (2013) - [j15]Pascal O. Vontobel:
The Bethe Permanent of a Nonnegative Matrix. IEEE Trans. Inf. Theory 59(3): 1866-1901 (2013) - [j14]Pascal O. Vontobel:
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function. IEEE Trans. Inf. Theory 59(9): 6018-6048 (2013) - [c29]Ron M. Roth, Pascal O. Vontobel:
Coding for combined block-symbol error correction. ISIT 2013: 1217-1221 - [c28]Henry D. Pfister, Pascal O. Vontobel:
On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes. ISIT 2013: 3000-3004 - [i31]Ron M. Roth, Pascal O. Vontobel:
Coding for Combined Block-Symbol Error Correction. CoRR abs/1302.1931 (2013) - 2012
- [j13]Roxana Smarandache, Pascal O. Vontobel:
Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds. IEEE Trans. Inf. Theory 58(2): 585-607 (2012) - [j12]Alexandros G. Dimakis, Roxana Smarandache, Pascal O. Vontobel:
LDPC Codes for Compressed Sensing. IEEE Trans. Inf. Theory 58(5): 3093-3114 (2012) - [c27]Farzad Parvaresh, Pascal O. Vontobel:
Approximately counting the number of constrained arrays via the sum-product algorithm. ISIT 2012: 279-283 - [c26]Hans-Andrea Loeliger, Pascal O. Vontobel:
A factor-graph representation of probabilities in quantum mechanics. ISIT 2012: 656-660 - [c25]Pascal O. Vontobel:
The Bethe approximation of the pattern maximum likelihood distribution. ISIT 2012: 2012-2016 - [i30]Hans-Andrea Loeliger, Pascal O. Vontobel:
A Factor-Graph Representation of Probabilities in Quantum Mechanics. CoRR abs/1201.5422 (2012) - [i29]Mayur Punekar, Pascal O. Vontobel, Mark F. Flanagan:
Low-Complexity LP Decoding of Nonbinary Linear Codes. CoRR abs/1211.5757 (2012) - 2011
- [j11]Ali Emre Pusane, Roxana Smarandache, Pascal O. Vontobel, Daniel J. Costello Jr.:
Deriving Good LDPC Convolutional Codes from LDPC Block Codes. IEEE Trans. Inf. Theory 57(2): 835-857 (2011) - [c24]Ali Al-Bashabsheh, Yongyi Mao, Pascal O. Vontobel:
Normal factor graphs: A diagrammatic approach to linear algebra. ISIT 2011: 2178-2182 - [c23]Pascal O. Vontobel:
A factor-graph approach to Lagrangian and Hamiltonian dynamics. ISIT 2011: 2183-2187 - [c22]Pascal O. Vontobel:
A combinatorial characterization of the Bethe and the Kikuchi partition functions. ITA 2011: 445-454 - [i28]G. David Forney Jr., Pascal O. Vontobel:
Partition Functions of Normal Factor Graphs. CoRR abs/1102.0316 (2011) - [i27]Ali Al-Bashabsheh, Yongyi Mao, Pascal O. Vontobel:
Normal Factor Graphs: A Diagrammatic Approach to Linear Algebra. CoRR abs/1102.5755 (2011) - [i26]Pascal O. Vontobel:
The Bethe Permanent of a Non-Negative Matrix. CoRR abs/1107.4196 (2011) - 2010
- [j10]Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel:
On linear balancing sets. Adv. Math. Commun. 4(3): 345-361 (2010) - [c21]Pascal O. Vontobel:
The Bethe permanent of a non-negative matrix. Allerton 2010: 341-346 - [c20]Pascal O. Vontobel:
Connecting the Bethe entropy and the edge zeta function of a cycle code. ISIT 2010: 704-708 - [c19]Pascal O. Vontobel:
A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization. ITA 2010: 525-534 - [i25]Ali Emre Pusane, Roxana Smarandache, Pascal O. Vontobel, Daniel J. Costello Jr.:
Deriving Good LDPC Convolutional Codes from LDPC Block Codes. CoRR abs/1004.5157 (2010) - [i24]Pascal O. Vontobel:
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function. CoRR abs/1012.0065 (2010) - [i23]Alexandros G. Dimakis, Roxana Smarandache, Pascal O. Vontobel:
LDPC Codes for Compressed Sensing. CoRR abs/1012.0602 (2010)
2000 – 2009
- 2009
- [j9]Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams:
Optimization of Information Rate Upper and Lower Bounds for Channels With Memory. IEEE Trans. Inf. Theory 55(2): 663-688 (2009) - [j8]Roxana Smarandache, Ali Emre Pusane, Pascal O. Vontobel, Daniel J. Costello Jr.:
Pseudocodeword performance analysis for LDPC convolutional codes. IEEE Trans. Inf. Theory 55(6): 2577-2598 (2009) - [j7]Ron M. Roth, Pascal O. Vontobel:
List decoding of burst errors. IEEE Trans. Inf. Theory 55(9): 4179-4190 (2009) - [c18]Alexandros G. Dimakis, Pascal O. Vontobel:
LP decoding meets LP decoding: A connection between channel coding and compressed sensing. Allerton 2009: 8-15 - [c17]Roxana Smarandache, Pascal O. Vontobel:
Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties. ISIT 2009: 229-233 - [c16]Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel:
On linear balancing sets. ISIT 2009: 2699-2703 - [i22]Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel:
On linear balancing sets. CoRR abs/0901.3170 (2009) - [i21]Roxana Smarandache, Pascal O. Vontobel:
Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds. CoRR abs/0901.4129 (2009) - [i20]Roxana Smarandache, Pascal O. Vontobel:
Absdet-Pseudo-Codewords and Perm-Pseudo-Codewords: Definitions and Properties. CoRR abs/0904.2022 (2009) - [i19]Alexandros G. Dimakis, Pascal O. Vontobel:
LP Decoding meets LP Decoding: A Connection between Channel Coding and Compressed Sensing. CoRR abs/0910.1121 (2009) - 2008
- [j6]Pascal O. Vontobel, Aleksandar Kavcic, Dieter-Michael Arnold, Hans-Andrea Loeliger:
A Generalization of the Blahut-Arimoto Algorithm to Finite-State Channels. IEEE Trans. Inf. Theory 54(5): 1887-1918 (2008) - [c15]Pascal O. Vontobel:
Symbolwise graph-cover decoding: Connecting sum-product algorithm decoding and bethe free energy minimization. Allerton 2008: 1416 - [c14]Ron M. Roth, Pascal O. Vontobel:
List decoding of burst errors. ISIT 2008: 66-70 - [i18]Pascal O. Vontobel:
Interior-Point Algorithms for Linear-Programming Decoding. CoRR abs/0802.1369 (2008) - [i17]Pascal O. Vontobel:
Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs. CoRR abs/0807.3566 (2008) - [i16]Ron M. Roth, Pascal O. Vontobel:
List Decoding of Burst Errors. CoRR abs/0808.2837 (2008) - 2007
- [j5]Pascal O. Vontobel, Ralf Koetter:
On low-complexity linear-programming decoding of LDPC codes. Eur. Trans. Telecommun. 18(5): 509-517 (2007) - [j4]Roxana Smarandache, Pascal O. Vontobel:
Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes. IEEE Trans. Inf. Theory 53(7): 2376-2393 (2007) - [j3]Ashwin Ganesan, Pascal O. Vontobel:
On the Existence of Universally Decodable Matrices. IEEE Trans. Inf. Theory 53(7): 2572-2575 (2007) - [c13]Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams:
Optimizing Information Rate Bounds for Channels with Memory. ISIT 2007: 171-175 - [c12]Ali Emre Pusane, Roxana Smarandache, Pascal O. Vontobel, Daniel J. Costello Jr.:
On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes. ISIT 2007: 1221-1225 - [i15]Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams:
Optimization of Information Rate Upper and Lower Bounds for Channels with Memory. CoRR abs/0711.4406 (2007) - 2006
- [j2]Pascal O. Vontobel, Ashwin Ganesan:
On universally decodable matrices for space-time coding. Des. Codes Cryptogr. 41(3): 325-342 (2006) - [j1]Dieter-Michael Arnold, Hans-Andrea Loeliger, Pascal O. Vontobel, Aleksandar Kavcic, Wei Zeng:
Simulation-Based Computation of Information Rates for Channels With Memory. IEEE Trans. Inf. Theory 52(8): 3498-3508 (2006) - [c11]Roxana Smarandache, Ali Emre Pusane, Pascal O. Vontobel, Daniel J. Costello Jr.:
Pseudo-Codewords in LDPC Convolutional Codes. ISIT 2006: 1364-1368 - [c10]Pascal O. Vontobel, Ralf Koetter:
Bounds on the Threshold of Linear Programming Decoding. ITW 2006: 175-179 - [i14]Ashwin Ganesan, Pascal O. Vontobel:
On the Existence of Universally Decodable Matrices. CoRR abs/cs/0601066 (2006) - [i13]Pascal O. Vontobel, Ashwin Ganesan:
On Universally Decodable Matrices for Space-Time Coding. CoRR abs/cs/0601075 (2006) - [i12]Ralf Koetter, Pascal O. Vontobel:
On the Block Error Probability of LP Decoding of LDPC Codes. CoRR abs/cs/0602086 (2006) - [i11]Pascal O. Vontobel, Ralf Koetter:
Bounds on the Threshold of Linear Programming Decoding. CoRR abs/cs/0602087 (2006) - [i10]Pascal O. Vontobel, Ralf Koetter:
Towards Low-Complexity Linear-Programming Decoding. CoRR abs/cs/0602088 (2006) - [i9]Roxana Smarandache, Pascal O. Vontobel:
Pseudo-Codeword Analysis of Tanner Graphs from Projective and Euclidean Planes. CoRR abs/cs/0602089 (2006) - [i8]Roxana Smarandache, Ali Emre Pusane, Pascal O. Vontobel, Daniel J. Costello Jr.:
Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes. CoRR abs/cs/0609148 (2006) - 2005
- [c9]Jon Feldman, Ralf Koetter, Pascal O. Vontobel:
The benefit of thresholding in LP decoding of LDPC codes. ISIT 2005: 307-311 - [c8]Pascal O. Vontobel, Roxana Smarandache, Negar Kiyavash, Jason Teutsch, Dejan Vukobratovic:
On the minimal pseudo-codewords of codes from finite geometries. ISIT 2005: 980-984 - [i7]Ralf Koetter, Wen-Ching W. Li, Pascal O. Vontobel, Judy L. Walker:
Pseudo-Codewords of Cycle Codes via Zeta Functions. CoRR abs/cs/0502033 (2005) - [i6]Jon Feldman, Ralf Koetter, Pascal O. Vontobel:
The Benefit of Thresholding in LP Decoding of LDPC Codes. CoRR abs/cs/0508014 (2005) - [i5]Pascal O. Vontobel, Roxana Smarandache, Negar Kiyavash, Jason Teutsch, Dejan Vukobratovic:
On the Minimal Pseudo-Codewords of Codes from Finite Geometries. CoRR abs/cs/0508019 (2005) - [i4]Ralf Koetter, Wen-Ching W. Li, Pascal O. Vontobel, Judy L. Walker:
Characterizations of Pseudo-Codewords of LDPC Codes. CoRR abs/cs/0508049 (2005) - [i3]Pascal O. Vontobel, Ashwin Ganesan:
An Explicit Construction of Universally Decodable Matrices. CoRR abs/cs/0508098 (2005) - [i2]Pascal O. Vontobel, Roxana Smarandache:
On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes. CoRR abs/cs/0510043 (2005) - [i1]Pascal O. Vontobel, Ralf Koetter:
Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes. CoRR abs/cs/0512078 (2005) - 2004
- [c7]Pascal O. Vontobel:
A Factor-Graph Approach to the Context-Tree Weighting Method. Data Compression Conference 2004: 571 - [c6]Pascal O. Vontobel, Ralf Koetter:
Lower bounds on the minimum pseudoweight of linear codes. ISIT 2004: 70 - [c5]Roxana Smarandache, Pascal O. Vontobel:
On regular quasicyclic LDPC codes from binomials. ISIT 2004: 274 - [c4]Ralf Koetter, Wen-Ching W. Li, Pascal O. Vontobel, Judy L. Walker:
Pseudo-codewords of cycle codes via zeta functions. ITW 2004: 7-12 - 2003
- [b1]Pascal O. Vontobel:
Algebraic coding for iterative decoding. ETH Zurich, Zürich, Switzerland, Hartung-Gorre 2003, ISBN 978-3-89649-865-6, pp. 1-245 - [c3]Pascal O. Vontobel, Hans-Andrea Loeliger:
Factor graphs and dynamical electrical networks. ITW 2003: 218-221 - [p1]Pascal O. Vontobel, Hans-Andrea Loeliger:
On Factor Graphs and Electrical Networks. Mathematical Systems Theory in Biology, Communications, Computation, and Finance 2003: 469-492 - 2002
- [c2]Pascal O. Vontobel:
On the construction of turbo code interleavers based on graphs with large girth. ICC 2002: 1408-1412 - 2001
- [c1]Pascal O. Vontobel, Dieter-Michael Arnold:
An upper bound on the capacity of channels with memory and constraint input. ITW 2001: 147-149
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-10-12 23:01 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:
