default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBixio Rimoldi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j20]Stefano Rosati, Karol Kruzelecki, Gregoire Heitz, Dario Floreano, Bixio Rimoldi:
Dynamic Routing for Flying Ad Hoc Networks. IEEE Trans. Veh. Technol. 65(3): 1690-1700 (2016)- 2015
- [i10]Mattia Carpin, Stefano Rosati, Mohammad Emtiyaz Khan, Bixio Rimoldi:
UAVs using Bayesian Optimization to Locate WiFi Devices. CoRR abs/1510.03592 (2015) - 2014
- [j19]Vojislav Gajic, Jianwei Huang, Bixio Rimoldi:
Competition of Wireless Providers for Atomic Users. IEEE/ACM Trans. Netw. 22(2): 512-525 (2014) - [i9]Stefano Rosati, Karol Kruzelecki, Gregoire Heitz, Dario Floreano, Bixio Rimoldi:
Dynamic Routing for Flying Ad Hoc Networks. CoRR abs/1406.4399 (2014) - 2013
- [j18]Stefano Rosati, Stefano Tomasin, Matteo Butussi, Bixio Rimoldi:
LLR Compression for BICM Systems Using Large Constellations. IEEE Trans. Commun. 61(7): 2864-2875 (2013) - [c15]Stefano Rosati, Karol Kruzelecki, Louis Traynard, Bixio Rimoldi:
Speed-aware routing for UAV ad-hoc networks. GLOBECOM Workshops 2013: 1367-1373 - [c14]Adrian Taniceriu, Bixio Rimoldi, Pierre Dillenbourg:
Error correction mechanism for five-key chording keyboards. SpeD 2013: 1-6 - [i8]Stefano Rosati, Karol Kruzelecki, Louis Traynard, Bixio Rimoldi:
Speed-Aware Routing for UAV Ad-Hoc Networks. CoRR abs/1307.6350 (2013) - 2012
- [j17]Ninoslav Marina
, Bixio Rimoldi:
On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels. IEEE Trans. Inf. Theory 58(7): 4355-4366 (2012) - [c13]Alberto Jimenez-Pacheco, Denia Bouhired, Yannick Gasser, Jean-Christophe Zufferey, Dario Floreano, Bixio Rimoldi:
Implementation of a wireless mesh network of ultra light MAVs with dynamic routing. GLOBECOM Workshops 2012: 1591-1596 - [i7]Stefano Rosati, Stefano Tomasin, Matteo Butussi, Bixio Rimoldi:
LLR Compression for BICM Systems Using Large Constellations. CoRR abs/1210.5183 (2012) - 2010
- [c12]Marius Kleiner, Bixio Rimoldi:
A tight bound on the performance of a minimal-delay joint source-channel coding scheme. ISIT 2010: 136-140 - [i6]Marius Kleiner, Bixio Rimoldi:
A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme. CoRR abs/1001.2488 (2010) - [i5]Vojislav Gajic, Jianwei Huang, Bixio Rimoldi:
Competition of Wireless Providers for Atomic Users. CoRR abs/1007.1087 (2010)
2000 – 2009
- 2009
- [j16]Peter Berlin, Baris Nakiboglu, Bixio Rimoldi, Emre Telatar:
A simple converse of Burnashev's reliability function. IEEE Trans. Inf. Theory 55(7): 3074-3080 (2009) - [c11]Vojislav Gajic, Jianwei Huang, Bixio Rimoldi:
Competition of wireless providers for atomic users: Equilibrium and social optimality. Allerton 2009: 1203-1210 - [c10]Marius Kleiner, Bixio Rimoldi:
Asymptotically Optimal Joint Source-Channel Coding with Minimal Delay. GLOBECOM 2009: 1-5 - [c9]Marius Kleiner, Bixio Rimoldi:
On fidelity per unit cost. ISIT 2009: 1639-1643 - [i4]Vojislav Gajic, Jianwei Huang, Bixio Rimoldi:
On Competing Wireless Service Providers. CoRR abs/0903.1972 (2009) - [i3]Marius Kleiner, Bixio Rimoldi:
Asymptotically Optimal Joint Source-Channel Coding with Minimal Delay. CoRR abs/0904.1281 (2009) - 2008
- [c8]Vojislav Gajic, Bixio Rimoldi:
Game theoretic considerations for the Gaussian Multiple Access Channel. ISIT 2008: 2523-2527 - [i2]Ninoslav Marina, Bixio Rimoldi:
On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels. CoRR abs/0802.3401 (2008) - 2006
- [c7]Peter Berlin, Bixio Rimoldi, Emre Telatar:
A Simple Derivation of Burnashev's Reliability Function. ITW 2006: 203-205 - [i1]Peter Berlin, Baris Nakiboglu, Bixio Rimoldi, Emre Telatar:
A Simple Derivation of Burnashev's Reliability Function. CoRR abs/cs/0610145 (2006) - 2005
- [c6]Rajesh Manakkal, Bixio Rimoldi:
A source-channel coding scheme for discrete memoryless channels with feedback. ISIT 2005: 1511-1515 - [c5]Nicolae Chiurtu, Linus Gasser, Philippe Roud, Bixio Rimoldi:
Software-defined radio implementation of multiple antenna systems using low-density parity-check codes. WCNC 2005: 527-531 - 2004
- [c4]Ninoslav Marina, Bixio Rimoldi:
On the structure of the capacity region of the Gaussian multiple access channel. ISIT 2004: 109 - 2003
- [j15]Michael Gastpar, Bixio Rimoldi, Martin Vetterli:
To code, or not to code: lossy source-channel communication revisited. IEEE Trans. Inf. Theory 49(5): 1147-1158 (2003) - [c3]Michael Gastpar, Bixio Rimoldi:
Source-channel communication with feedback. ITW 2003: 279-282 - 2002
- [j14]Quinn Li, Bixio Rimoldi, Marvin K. Simon:
Bandwidth-efficient constant-energy trellis-coded modulation schemes with prescribed decoding delay. IEEE Trans. Inf. Theory 48(5): 1150-1161 (2002) - 2001
- [j13]Christian Bonnet, Giuseppe Caire, Alain Enout, Pierre A. Humblet, Giuseppe Montalbano, Alessandro Nordio, Dominique Nussbaum, Thomas Höhne, Raymond Knopp, Bixio Rimoldi:
An open software-radio architecture supporting advanced 3G+ systems. Ann. des Télécommunications 56(5-6): 332-343 (2001) - [j12]Alexander J. Grant, Bixio Rimoldi, Rüdiger L. Urbanke, Philip A. Whiting:
Rate-splitting multiple access for discrete memoryless channels. IEEE Trans. Inf. Theory 47(3): 873-890 (2001) - [j11]Bixio Rimoldi:
Generalized time sharing: A low-complexity capacity-achieving multiple-access technique. IEEE Trans. Inf. Theory 47(6): 2432-2442 (2001) - [j10]Long Duan, Bixio Rimoldi:
The iterative turbo decoding algorithm has fixed points. IEEE Trans. Inf. Theory 47(7): 2993-2995 (2001) - [c2]Nicolae Chiurtu, Bixio Rimoldi, Emre Telatar:
Dense multiple antenna systems. ITW 2001: 108-109 - 2000
- [j9]Eli Shusterman, Michael I. Miller, Bixio Rimoldi:
Rate-distortion theory applied to automatic object recognition. IEEE Trans. Inf. Theory 46(5): 1921-1927 (2000) - [c1]Nicolae Chiurtu, Bixio Rimoldi:
Varying the antenna locations to optimize the capacity of multi-antenna Gaussian channels. ICASSP 2000: 3121-3123
1990 – 1999
- 1998
- [j8]Rüdiger L. Urbanke, Bixio Rimoldi:
Lattice Codes Can Achieve Capacity on the AWGN Channel. IEEE Trans. Inf. Theory 44(1): 273-278 (1998) - 1996
- [j7]Bixio Rimoldi, Rüdiger L. Urbanke:
A rate-splitting approach to the Gaussian multiple-access channel. IEEE Trans. Inf. Theory 42(2): 364-375 (1996) - 1995
- [j6]Bixio Rimoldi, Quinn Li:
Coded continuous phase modulation using ring convolutional codes. IEEE Trans. Commun. 43(11): 2714-2720 (1995) - 1994
- [j5]Bixio Rimoldi:
Successive refinement of information: characterization of the achievable rates. IEEE Trans. Inf. Theory 40(1): 253-259 (1994) - [j4]Bixio Rimoldi, Quinn Li:
Catastrophic continuous phase modulation schemes and their noncatastrophic equivalents. IEEE Trans. Inf. Theory 40(3): 687-695 (1994) - 1991
- [j3]Bixio Rimoldi:
Exact formula for the minimum squared Euclidean distance of CPFSK. IEEE Trans. Commun. 39(9): 1280-1282 (1991)
1980 – 1989
- 1989
- [j2]Bixio Rimoldi:
Design of coded CPFSK modulation systems for bandwidth and energy efficiency. IEEE Trans. Commun. 37(9): 897-905 (1989) - 1988
- [j1]Bixio Rimoldi:
A decomposition approach to CPM. IEEE Trans. Inf. Theory 34(2): 260-270 (1988)
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:15 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:
