default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJie Luo 0001
Person information
- affiliation: Colorado State University
- affiliation: University of Maryland
- affiliation: University of Connecticut
Other persons with the same name
- Jie Luo — disambiguation page
- Jie Luo 0002 — Wenzhou University, Department of Computer Science, China
- Jie Luo 0003 — Harvard Medical School, Radiology Department, Brigham and Women's Hospital, Boston, USA (and 1 more)
- Jie Luo 0004
![[0000-0002-4157-9931]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-4157-9931")
— Beihang University, State Key Laboratory of Software Development Environment, Beijing, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j26]Jie Luo:
A Generalized Channel Coding Theory for Distributed Communication. IEEE Trans. Commun. 63(4): 1043-1056 (2015)- 2013
- [j25]Zheng Wang, Jie Luo:
Fountain Communication using Concatenated Codes. IEEE Trans. Commun. 61(2): 443-454 (2013) - 2012
- [j24]Jie Luo, Anthony Ephremides:
A New Approach to Random Access: Reliable Communication and Reliable Collision Detection. IEEE Trans. Inf. Theory 58(2): 989-1002 (2012) - [j23]Zheng Wang, Jie Luo:
Error Performance of Channel Coding in Random-Access Communication. IEEE Trans. Inf. Theory 58(6): 3961-3974 (2012) - [j22]Lihua Wan, Jie Luo:
On the Complexity of Wireless Multicast Optimization. IEEE Wirel. Commun. Lett. 1(6): 593-596 (2012) - 2010
- [j21]Jie Luo, Anthony Ephremides:
Superiority of Superposition Multiaccess With Single-User Decoding Over TDMA in the Low SNR Regime. IEEE Trans. Inf. Theory 56(11): 5581-5589 (2010) - 2009
- [j20]Zheng Wang, Jie Luo:
Approaching blokh-zyablov error exponent with linear-time encodable/decodable codes. IEEE Commun. Lett. 13(6): 438-440 (2009) - 2008
- [j19]Jie Luo:
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes. IEEE Trans. Inf. Theory 54(12): 5756-5760 (2008) - 2007
- [j18]Jie Luo, Anthony Ephremides:
On rate control of packet transmission over fading channels. IEEE Commun. Lett. 11(12): 982-984 (2007) - [j17]Jie Luo, Krishna R. Pattipati, Liu Qiao, Shunsuke Chigusa:
An Integrated Diagnostic Development Process for Automotive Engine Control Systems. IEEE Trans. Syst. Man Cybern. Part C 37(6): 1163-1173 (2007) - 2006
- [j16]Jie Luo, Anthony Ephremides:
Power levels and packet lengths in random multiple access with multiple-packet reception capability. IEEE Trans. Inf. Theory 52(2): 414-420 (2006) - [j15]Jie Luo, Anthony Ephremides:
On the throughput, capacity, and stability regions of random multiple access. IEEE Trans. Inf. Theory 52(6): 2593-2607 (2006) - 2005
- [j14]Jie Luo, Sennur Ulukus, Anthony Ephremides:
Standard and quasi-standard stochastic power control algorithms. IEEE Trans. Inf. Theory 51(7): 2612-2624 (2005) - [j13]Jie Luo, Sennur Ulukus, Anthony Ephremides:
Optimal sequences and sum capacity of symbol asynchronous CDMA systems. IEEE Trans. Inf. Theory 51(8): 2760-2769 (2005) - 2004
- [j12]David Pham, Krishna R. Pattipati, Peter K. Willett, Jie Luo:
A generalized probabilistic data association detector for multiple antenna systems. IEEE Commun. Lett. 8(4): 205-207 (2004) - [j11]David Pham, Krishna R. Pattipati, Peter K. Willett, Jie Luo:
An improved complex sphere decoder for V-BLAST systems. IEEE Signal Process. Lett. 11(9): 748-751 (2004) - [j10]Fumihiro Hasegawa, Jie Luo, Krishna R. Pattipati, Peter Willett, David Pham:
Speed and accuracy comparison of techniques for multiuser detection in synchronous CDMA. IEEE Trans. Commun. 52(4): 540-545 (2004) - [j9]Jie Luo, Krishna R. Pattipati, Peter Willett, Georgiy M. Levchuk:
Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound. IEEE Trans. Commun. 52(4): 632-642 (2004) - 2003
- [j8]Jie Luo, Krishna R. Pattipati, Peter Willett, Georgiy M. Levchuk:
Optimal grouping algorithm for a group decision feedback detector in synchronous CDMA communications. IEEE Trans. Commun. 51(3): 341-346 (2003) - [j7]Jie Luo, Krishna R. Pattipati, Peter K. Willett, Fumihiro Hasegawa:
Optimal user ordering and time labeling for ideal decision feedback detection in asynchronous CDMA. IEEE Trans. Commun. 51(11): 1754-1757 (2003) - [j6]Jie Luo, Krishna R. Pattipati, Peter K. Willett:
A sliding window PDA for asynchronous CDMA, and a proposal for deliberate asynchronicity. IEEE Trans. Commun. 51(12): 1970-1974 (2003) - 2002
- [j5]David Pham, Jie Luo, Krishna R. Pattipati, Peter Willett:
A PDA-Kalman approach to multiuser detection in asynchronous CDMA. IEEE Commun. Lett. 6(11): 475-477 (2002) - [j4]Georgiy M. Levchuk, Yuri N. Levchuk, Jie Luo, Krishna R. Pattipati, David L. Kleinman:
Normative design of organizations. I. Mission planning. IEEE Trans. Syst. Man Cybern. Part A 32(3): 346-359 (2002) - [j3]Georgiy M. Levchuk, Yuri N. Levchuk, Jie Luo, Krishna R. Pattipati, David L. Kleinman:
Normative design of organizations. II. Organizational structure. IEEE Trans. Syst. Man Cybern. Part A 32(3): 360-375 (2002) - 2001
- [j2]Jie Luo, Krishna R. Pattipati, Peter K. Willett, Fumihiro Hasegawa:
Near-optimal multiuser detection in synchronous CDMA using probabilistic data association. IEEE Commun. Lett. 5(9): 361-363 (2001) - 1999
- [j1]Jie Luo, Bo Hu, Xie-Ting Ling, Ruey-Wen Liu:
Principal independent component analysis. IEEE Trans. Neural Networks 10(4): 912-917 (1999)
Conference and Workshop Papers
- 2011
- [c23]Louis L. Scharf, Edwin K. P. Chong, Ali Pezeshki, J. Rockey Luo:
Sensitivity considerations in compressed sensing. ACSCC 2011: 744-748 - [c22]Zheng Wang, Jie Luo:
Coding theorems for random access communication over compound channel. ISIT 2011: 988-992 - 2010
- [c21]Zheng Wang, Jie Luo:
Achievable error exponent of channel coding in random access communication. ISIT 2010: 270-274 - [c20]Jie Luo, Anthony Ephremides:
A channel coding approach for random access communication with bursty sources. ISIT 2010: 1823-1827 - [c19]Lihua Wan, Jie Luo:
Wireless multicasting via iterative optimization. ISIT 2010: 2333-2337 - 2009
- [c18]Zheng Wang, Jie Luo:
Concatenated fountain codes. ISIT 2009: 2341-2345 - 2008
- [c17]Lihua Wan, Jie Luo, Anthony Ephremides:
An iterative framework for optimizing multicast throughput in wireless networks. ISIT 2008: 196-200 - 2007
- [c16]Jie Luo, Anthony Ephremides:
Wireless Multicasting with Channel Uncertainty. CISS 2007: 800-805 - [c15]Jie Luo:
Fast Maximum Likelihood Sequence Detection Over Vector Intersymbol Interference Channels. ICASSP (3) 2007: 465-468 - 2006
- [c14]Jie Luo, Anthony Ephremides:
Comparison of Two Low Complexity Multiple Access Schemes. ISIT 2006: 2578-2582 - 2005
- [c13]Jie Luo, Anthony Ephremides:
On the throughput, capacity and stability regions of random multiple access over standard multi-packet reception channels. ISIT 2005: 2256-2260 - 2004
- [c12]Jie Luo, Sennur Ulukus, Anthony Ephremides:
Optimal sequences that maximize the information theoretic sum capacity of symbol asynchronous CDMA systems. GLOBECOM 2004: 267-271 - [c11]David Pham, Krishna R. Pattipati, Peter K. Willett, Jie Luo:
A generalized probabilistic data association detector for multiple antenna systems. ICC 2004: 3519-3522 - 2003
- [c10]Jie Luo, Krishna R. Pattipati, Peter Willett, Loïc Brunel:
Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA. ICC 2003: 3336-3340 - 2002
- [c9]Jie Luo, Krishna R. Pattipati, Peter Willett, Fumihiro Hasegawa:
Optimal user ordering and time labeling for decision feedback detection in asynchronous CDMA. ICASSP 2002: 2317-2320 - 2001
- [c8]Fumihiro Hasegawa, Jie Luo, Krishna R. Pattipati, Peter Willett:
Speed and accuracy comparison of techniques to solve a binary quadratic programming problem with applications to synchronous CDMA. CDC 2001: 4051-4056 - [c7]J. Rockey Luo, Krishna R. Pattipati, Peter Willett:
Optimal grouping and user ordering for sequential group detection in synchronous CDMA. GLOBECOM 2001: 738-742 - [c6]Jie Luo, Krishna R. Pattipati, Peter K. Willett, Fumihiro Hasegawa:
A PDA approach to CDMA multiuser detection. GLOBECOM 2001: 763-766 - [c5]Fumihiro Hasegawa, J. Rockey Luo, Krishna R. Pattipati, Peter K. Willett:
Speed and accuracy comparison of techniques to solve a binary quadratic programming problem with applications to synchronous CDMA. SMC 2001: 2775-2780 - [c4]Fumihiro Hasegawa, J. Rockey Luo, Krishna R. Pattipati, Peter K. Willett:
Performance of various methods for the solution of binary quadratic programming problems. SMC 2001: 2781-2786 - [c3]J. Rockey Luo, Krishna R. Pattipati, Peter K. Willett:
A sub-optimal soft decision PDA method for binary quadratic programming. SMC 2001: 3140-3145 - 2000
- [c2]Jie Luo, Georgiy M. Levchuk, Krishna R. Pattipati, Peter Willett:
A class of coordinate descent methods for multiuser detection. ICASSP 2000: 2853-2856 - [c1]Georgiy M. Levchuk, J. Rockey Luo, Yuri N. Levchuk, Krishna R. Pattipati:
Optimization algorithms in organizational design: optimality and complexity. SMC 2000: 2321-2326
Informal and Other Publications
- 2011
- [i6]Zheng Wang, Jie Luo:
Channel Coding in Random Access Communication over Compound Channels. CoRR abs/1110.1891 (2011) - 2010
- [i5]Zheng Wang, Jie Luo:
Error Performance of Channel Coding in Random Access Communication. CoRR abs/1010.0642 (2010) - 2009
- [i4]Zheng Wang, Jie Luo:
Fountain Communication using Concatenated Codes. CoRR abs/0907.2984 (2009) - [i3]Jie Luo, Anthony Ephremides:
A New Channel Coding Approach for Random Access with Bursty Traffic. CoRR abs/0909.0553 (2009) - 2008
- [i2]Zheng Wang, Jie Luo:
Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes. CoRR abs/0808.3756 (2008) - 2007
- [i1]Jie Luo:
On Optimality Test in Low Complexity Maximum Likelihood Decoding of Convolutional Codes. CoRR abs/0711.3077 (2007)
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-09-10 02:05 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:
