default search action
Claudio Weidmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j9]Alexandre Pitti
, Mathias Quoy, Catherine Lavandier
In Search of a Neural Model for Serial Order: A Brain Theory for Memory Development and Higher Level Cognition. IEEE Trans. Cogn. Dev. Syst. 14(2): 279-291 (2022) - 2021
- [j8]Hirah Malik
MICN: A network coding protocol for ICN with multiple distinct interests per generation. Comput. Networks 187: 107816 (2021) - 2020
- [c23]Hirah Malik, Cédric Adjih, Michel Kieffer, Claudio Weidmann:
On the Problem of Finding "Sets Ensuring Linearly Independent Transversals" (SELIT), and its Application to Network Coding. PEMWN 2020: 1-6 - [i2]Hirah Malik, Cédric Adjih, Claudio Weidmann, Michel Kieffer:
MICN: a network coding protocol for ICN with multiple distinct interests per generation. CoRR abs/2007.01128 (2020)
2010 – 2019
- 2017
- [c22]Ayat Zaki Hindi
NDN synchronization: iRoundSync, an improved RoundSync. ICN 2017: 194-195 - 2016
- [j7]Anne Savard
On the Gaussian multiway relay channel with intra-cluster links. EURASIP J. Wirel. Commun. Netw. 2016: 267 (2016) - 2015
- [c21]Anne Savard
Lattice coding for the Gaussian one- and two-way relay channels with correlated noises. ISIT 2015: 2076-2080 - 2014
- [c20]Anne Savard
Optimized codes for the binary coded side-information problem. ISTC 2014: 127-131 - [c19]Anne Savard
On the multiway relay channel with direct links. ITW 2014: 651-655 - 2013
- [c18]Anne Savard
Improved decoding for binary source coding with coded side information. ITW 2013: 1-5 - 2012
- [j6]Amadou Diallo, Claudio Weidmann, Michel Kieffer
New Free Distance Bounds and Design Techniques for Joint Source-Channel Variable-Length Codes. IEEE Trans. Commun. 60(10): 3080-3090 (2012) - [j5]Claudio Weidmann, Martin Vetterli
Rate Distortion Behavior of Sparse Sources. IEEE Trans. Inf. Theory 58(8): 4969-4992 (2012) - [j4]Claudio Weidmann, Gottfried Lechner
A Fresh Look at Coding for q-ary Symmetric Channels. IEEE Trans. Inf. Theory 58(11): 6959-6967 (2012) - [c17]Hassan L. Hijazi
A MILP Approach for Designing Robust Variable-Length Codes Based on Exact Free Distance Computation. DCC 2012: 257-266 - [c16]Ingmar Land
Characterizing the rate region of the coded side-information problem. ITW 2012: 322-326 - 2011
- [j3]Amadou Diallo, Claudio Weidmann, Michel Kieffer
Efficient Computation and Optimization of the Free Distance of Variable-Length Finite-State Joint Source-Channel Codes. IEEE Trans. Commun. 59(4): 1043-1052 (2011) - [c15]Claudio Weidmann:
Characterizing compressibility with Lorenz curves. ISIT 2011: 2228-2232 - 2010
- [j2]Claudio Weidmann, Michel Kieffer
Evaluation of the distance spectrum of variable-length finite-state codes. IEEE Trans. Commun. 58(3): 724-728 (2010) - [c14]Francesca Bassi, Michel Kieffer, Claudio Weidmann:
Wyner-Ziv coding with uncertain side information quality. EUSIPCO 2010: 2141-2145 - [c13]Amadou Diallo, Claudio Weidmann, Michel Kieffer
Optimizing the free distance of Error-Correcting Variable-Length Codes. MMSP 2010: 245-250
2000 – 2009
- 2009
- [c12]Amadou Diallo, Claudio Weidmann, Michel Kieffer:
Optimizing the search of finite-state joint source-channel codes based on arithmetic coding. EUSIPCO 2009: 1161-1165 - [i1]Claudio Weidmann, Gottfried Lechner:
A Fresh Look at Coding for q-ary Symmetric Channels. CoRR abs/0909.2009 (2009) - 2008
- [c11]Claudio Weidmann, Francesca Bassi, Michel Kieffer:
Practical distributed source coding with impulse-noise degraded side information at the decoder. EUSIPCO 2008: 1-5 - [c10]Francesca Bassi, Michel Kieffer
Source coding with intermittent and degraded side information at the decoder. ICASSP 2008: 2941-2944 - [c9]Claudio Weidmann:
Coding for the q-ary symmetric channel with moderate q. ISIT 2008: 2156-2159 - 2007
- [j1]Jay Cheng, Tien-Ke Huang, Claudio Weidmann:
New Bounds on the Expected Length of Optimal One-to-One Codes. IEEE Trans. Inf. Theory 53(5): 1884-1895 (2007) - [c8]Olivia Nemethova, Wolfgang Karner, Claudio Weidmann, Markus Rupp:
Distortion-minimizing network-aware scheduling for UMTS video streaming. EUSIPCO 2007: 1467-1471 - 2006
- [c7]Morten Holm Larsen, Claudio Weidmann, Michel Kieffer:
Iterative Decoding of Entropy-Constrained Multiple Description Trellis-Coded Quantization. GLOBECOM 2006 - [c6]Salma Ben Jamaa, Claudio Weidmann, Michel Kieffer
Asymptotic Error-Correcting Performance of Joint Source-Channel Schemes based on Arithmetic Coding. MMSP 2006: 262-266 - 2004
- [c5]Claudio Weidmann, Petr Kadlec, Olivia Nemethova, Ameen Al Moghrabi:
Combined sequential decoding and error concealment of H.264 video. MMSP 2004: 299-302 - 2000
- [c4]Claudio Weidmann, Martin Vetterli:
Rate Distortion Behavior of Threshold-Based Nonlinear Approximations. Data Compression Conference 2000: 333-342
1990 – 1999
- 1999
- [c3]Claudio Weidmann, Martin Vetterli:
Rate-Distortion Analysis of Spike Processes. Data Compression Conference 1999: 82-91 - 1998
- [c2]Claudio Weidmann, Jérôme Lebrun
Significance Tree Image Coding using Balanced Multiwavelets. ICIP (1) 1998: 97-101 - 1997
- [c1]Claudio Weidmann, Martin Vetterli, Antonio Ortega, Fabio Carignano:
Soft Caching: Image Caching in a Rate-Distortion Framework. ICIP (2) 1997: 696-699
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-25 05:59 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: