Updated: June 5th, 2023 08:42

2022 article

Modeling of Adaptive Receiver Performance Using Generative Adversarial Networks

*IEEE 72ND ELECTRONIC COMPONENTS AND TECHNOLOGY CONFERENCE (ECTC 2022)*, pp. 1958–1963.

author keywords: SerDes; receiver; behavior modeling; adaptive; generative; GAN; DFE; IBIS-AMI

Sources: Web Of Science, ORCID

Added: September 19, 2022

2022 journal article

Rigorous State Evolution Analysis for Approximate Message Passing with Side Information

*IEEE Transactions on Information Theory*.

Source: ORCID

Added: November 10, 2022

2022 article

RxGAN: Modeling High-Speed Receiver through Generative Adversarial Networks

*MLCAD '22: PROCEEDINGS OF THE 2022 ACM/IEEE 4TH WORKSHOP ON MACHINE LEARNING FOR CAD (MLCAD)*, pp. 167–172.

author keywords: SerDes; receiver; behavior modeling; adaptive; generative; measurement; GAN; DFE; IBIS-AMI

Sources: Web Of Science, ORCID

Added: October 31, 2022

2021 article

CONTACT TRACING ENHANCES THE EFFICIENCY OF COVID-19 GROUP TESTING

*2021 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP 2021)*, pp. 8168–8172.

author keywords: Contact tracing; nonadaptive group testing; compressed sensing; overlapping group LASSO; generalized approximate message passing (GAMP)

Sources: Web Of Science, ORCID

Added: November 29, 2021

2021 article

High Speed Receiver Modeling Using Generative Adversarial Networks

*IEEE 30TH CONFERENCE ON ELECTRICAL PERFORMANCE OF ELECTRONIC PACKAGING AND SYSTEMS (EPEPS 2021)*.

author keywords: eye diagram; IBIS-AMI; generative model; generative adversarial network; GAN; receiver

Sources: Web Of Science, ORCID

Added: March 21, 2022

2021 article

Local Convergence of an AMP Variant to the LASSO Solution in Finite Dimensions

*2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)*, pp. 2256–2261.

Sources: Web Of Science, ORCID

Added: October 26, 2021

2019 journal article

An Approximate Message Passing Framework for Side Information

*IEEE TRANSACTIONS ON SIGNAL PROCESSING*, *67*(7), 1875–1888.

author keywords: Approximate message passing; side information; sparse signal recovery

Sources: Web Of Science, ORCID

Added: March 25, 2019

2019 article

Analysis of Approximate Message Passing With Non-Separable Denoisers and Markov Random Field Priors

Ma, Y., Rush, C., & Baron, D. (2019, November). *IEEE TRANSACTIONS ON INFORMATION THEORY*, Vol. 65, pp. 7367–7389.

author keywords: Approximation algorithms; Task analysis; Approximate message passing; non-separable denoiser; Markov random field; finite sample analysis

Sources: Web Of Science, ORCID

Added: February 3, 2020

2018 journal article

Performance Limits With Additive Error Metrics in Noisy Multimeasurement Vector Problems

*IEEE TRANSACTIONS ON SIGNAL PROCESSING*, *66*(20), 5338–5348.

author keywords: Active user detection; error metric; message passing; multi-measurement vector problem

Sources: Web Of Science, ORCID

Added: October 16, 2018

2017 conference paper

An overview of multi-processor approximate message passing

*2017 51st Annual Conference on Information Sciences and Systems (CISS)*. Presented at the 2017 51st Annual Conference on Information Sciences and Systems (CISS).

Event: 2017 51st Annual Conference on Information Sciences and Systems (CISS)

Sources: Crossref, ORCID

Added: March 9, 2019

2017 conference paper

Analysis of approximate message passing with a class of non-separable denoisers

*2017 ieee international symposium on information theory (isit)*, 231–235.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2017 conference paper

Conditional approximate message passing with side information

*2017 51st Asilomar Conference on Signals, Systems, and Computers*. Presented at the 2017 51st Asilomar Conference on Signals, Systems, and Computers.

Event: 2017 51st Asilomar Conference on Signals, Systems, and Computers

Sources: Crossref, ORCID

Added: March 9, 2019

2017 conference paper

Generalized geometric programming for rate allocation in consensus

*2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)*. Presented at the 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

Event: 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Sources: Crossref, ORCID

Added: March 9, 2019

2017 conference paper

Multiprocessor approximate message passing with column-wise partitioning

*2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)*. Presented at the 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

Event: 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

Sources: Crossref, ORCID

Added: March 9, 2019

2017 journal article

Performance Limits for Noisy Multimeasurement Vector Problems

*IEEE TRANSACTIONS ON SIGNAL PROCESSING*, *65*(9), 2444–2454.

author keywords: Approximate message passing; multimeasurement vector problem; replica analysis

Sources: Web Of Science, ORCID

Added: August 6, 2018

2016 journal article

Approximate Message Passing Algorithm With Universal Denoising and Gaussian Mixture Learning

*IEEE Transactions on Signal Processing*, *64*(21), 5611–5622.

author keywords: Approximate message passing; compressed sensing; Gaussian mixture model; universal denoising

Sources: Crossref, ORCID

Added: March 9, 2019

2016 journal article

Compressive Hyperspectral Imaging via Approximate Message Passing

*IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING*, *10*(2), 389–401.

author keywords: Approximate message passing; CASSI; compressive hyperspectral imaging; gradient projection for sparse reconstruction; image denoising; two-step iterative shrinkage/thresholding; Wiener filtering

Sources: Web Of Science, ORCID

Added: August 6, 2018

2016 conference paper

Multi-processor approximate message passing using lossy compression

*International conference on acoustics speech and signal processing*, 6240–6244.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2016 conference paper

Performance trade-offs in multi-processor approximate message passing

*2016 ieee international symposium on information theory*, 680–684.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2015 journal article

A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm

*IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING*, *9*(4), 741–748.

author keywords: Big data; computational complexity; data compression; distributed computing; minimum description length; parallel algorithms; redundancy; two-pass code; universal compression; work-efficient algorithms

Sources: Web Of Science, ORCID

Added: August 6, 2018

2015 conference paper

Approximate message passing in coded aperture snapshot spectral imaging

*2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP)*. Presented at the 2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

Event: 2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP)

Sources: Crossref, ORCID

Added: March 9, 2019

2015 journal article

Compressive Imaging via Approximate Message Passing With Image Denoising

*IEEE Transactions on Signal Processing*, *63*(8), 2085–2092.

author keywords: Approximate message passing; compressive imaging; image denoising; wavelet transform

Sources: Crossref, ORCID

Added: March 9, 2019

2015 journal article

Creating Analytic Online Homework for Digital Signal Processing [sp Education]

*IEEE Signal Processing Magazine*, *32*(5), 112–118.

Sources: Crossref, ORCID, Web Of Science

Added: August 6, 2018

2015 conference paper

Mismatched estimation in large linear systems

*2015 ieee international symposium on information theory (isit)*, 760–764.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2015 journal article

Recovery From Linear Measurements With Complexity-Matching Universal Signal Estimation

*IEEE TRANSACTIONS ON SIGNAL PROCESSING*, *63*(6), 1512–1527.

author keywords: Compressed sensing; MAP estimation; Markov chain Monte Carlo; universal algorithms

Sources: Web Of Science, ORCID

Added: August 6, 2018

2014 conference paper

A Parallel two-pass MDL context tree algorithm for universal source coding

*2014 ieee international symposium on information theory (isit)*, 1862–1865.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2014 conference paper

Complexity-adaptive universal signal estimation for compressed sensing

*2014 IEEE Workshop on Statistical Signal Processing (SSP)*, 388–391.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2014 conference paper

Compressed Sensing via Universal Denoising and Approximate Message Passing

*Proc. 52d Allerton Conference on Communication, Control, and Computing*. Monticello, IL.

Source: NC State University Libraries

Added: March 9, 2019

2014 conference paper

Compressive imaging via approximate message passing with wavelet-based image denoising

*2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)*. Presented at the 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

Event: 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)

Sources: Crossref, ORCID

Added: March 9, 2019

2014 journal article

Empirical Bayes and Full Bayes for Signal Estimation

*ArXiv:1405.2113 [Cs, Math]*. http://arxiv.org/abs/1405.2113

Source: NC State University Libraries

Added: March 9, 2019

2014 conference paper

Performance of parallel two-pass MDL context tree algorithm

*2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)*. Presented at the 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

Event: 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)

Sources: Crossref, ORCID

Added: March 9, 2019

2014 journal article

Signal Estimation With Additive Error Metrics in Compressed Sensing

*IEEE TRANSACTIONS ON INFORMATION THEORY*, *60*(1), 150–158.

author keywords: Belief propagation (BP); compressed sensing; error metric; estimation theory

Sources: Web Of Science, ORCID

Added: August 6, 2018

2014 conference paper

Signal estimation with low infinity-norm error by minimizing the mean p-norm error

*2014 48th Annual Conference on Information Sciences and Systems (CISS)*.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2014 journal article

Two-Part Reconstruction With Noisy-Sudocodes

*IEEE TRANSACTIONS ON SIGNAL PROCESSING*, *62*(23), 6323–6334.

author keywords: Compressed sensing; two-part reconstruction; 1-bit CS

Sources: Web Of Science, ORCID

Added: August 6, 2018

2014 journal article

Wiener Filters in Gaussian Mixture Signal Estimation With l(infinity)-Norm Error

*IEEE TRANSACTIONS ON INFORMATION THEORY*, *60*(10), 6626–6635.

author keywords: Estimation theory; Gaussian mixtures; l(infinity)-norm error; linear mixing systems; parallel Gaussian channels; Wiener filters

Sources: Web Of Science, ORCID

Added: August 6, 2018

2013 journal article

Measurement Bounds for Sparse Signal Ensembles via Graphical Models

*IEEE Transactions on Information Theory*, *59*(7), 4280–4289.

author keywords: Compressive sensing (CS); random projections; signal ensembles; sparsity

Sources: Crossref, ORCID

Added: March 9, 2019

2013 conference paper

Performance regions in compressed sensing from noisy measurements

*2013 47th Annual Conference on Information Sciences and Systems (CISS)*.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2013 conference paper

Signal reconstruction in linear mixing systems with different error metrics

*2013 Information Theory and Applications Workshop (ITA)*.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2012 journal article

An MCMC Approach to Universal Lossy Compression of Analog Sources

*IEEE TRANSACTIONS ON SIGNAL PROCESSING*, *60*(10), 5230–5240.

author keywords: Compression algorithms; rate distortion; simulated annealing

Sources: Web Of Science, ORCID

Added: August 6, 2018

2012 conference paper

Optimal estimation with arbitrary error metrics in compressed sensing

*2012 IEEE Statistical Signal Processing Workshop (ssp)*, 588–591.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2012 journal article

Variable Length Compression of Codeword Indices for Lossy Compression

*IEEE SIGNAL PROCESSING LETTERS*, *19*(12), 849–852.

author keywords: Entropy coding; lossy compression; rate distortion; variable length coding

Sources: Web Of Science, ORCID

Added: August 6, 2018

2011 journal article

Fault Identification Via Nonparametric Belief Propagation

*IEEE TRANSACTIONS ON SIGNAL PROCESSING*, *59*(6), 2602–2613.

author keywords: Compressed sensing (CS); fault identification; message passing; nonparametric belief propagation (NBP); stochastic approximation

Sources: Web Of Science, ORCID

Added: August 6, 2018

2011 conference paper

Information complexity and estimation

*Fourth Workshop Inf. Theoretic Methods Science Eng.* Presented at the WITMSE 2011.

Event: WITMSE 2011

Source: NC State University Libraries

Added: March 9, 2019

2011 conference paper

Universal MAP estimation in compressed sensing

*2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)*. Presented at the 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

Event: 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Sources: Crossref, ORCID

Added: March 9, 2019

2010 conference paper

An MCMC Approach to Lossy Compression of Continuous Sources

*2010 Data Compression Conference*. Presented at the 2010 Data Compression Conference.

Event: 2010 Data Compression Conference

author keywords: Lossy compression; rate distortion theory; stationary ergodic sources; universal compression

Sources: Crossref, ORCID

Added: March 9, 2019

2010 journal article

Bayesian Compressive Sensing Via Belief Propagation

*IEEE Transactions on Signal Processing*, *58*(1), 269–280.

author keywords: Bayesian inference; belief propagation; compressive sensing; fast algorithms; sparse matrices

Sources: Crossref, ORCID

Added: March 9, 2019

2009 conference paper

A single-letter characterization of optimal noisy compressed sensing

*2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)*. Presented at the 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton 2009).

Event: 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton 2009)

Sources: Crossref, ORCID

Added: March 9, 2019

2009 report

Distributed Compressive Sensing

Sources: Crossref, ORCID

Added: March 23, 2019

2009 journal article

Representation and Compression of Multidimensional Piecewise Functions Using Surflets

*IEEE Transactions on Information Theory*, *55*(1), 374–400.

author keywords: Compression; discontinuities; metric entropy; multidimensional signals; multiscale representations; nonlinear approximation; rate-distortion; sparse representations; surflets; wavelets

Sources: Crossref, ORCID

Added: March 9, 2019

2008 conference paper

Performance Limits for Jointly Sparse Signals via Graphical Models

*Proceedings of Sensor, Signal, and Information Processing Workshop*. Presented at the SenSIP.

Event: SenSIP

Source: NC State University Libraries

Added: March 23, 2019

2008 conference paper

The secrecy of compressed sensing measurements

*2008 46th Annual Allerton Conference on Communication, Control, and Computing*. Presented at the 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

Event: 2008 46th Annual Allerton Conference on Communication, Control, and Computing

Sources: Crossref, ORCID

Added: March 18, 2019

2008 report

Theoretical Performace Limits for Jointly Sparse Signals via Graphical Models

(Technical Report No. ECE-0802). Electrical and Computer Engineering Department, Rice University.

Source: NC State University Libraries

Added: March 24, 2019

2006 conference paper

A new compressive imaging camera architecture using optical-domain compression

In C. A. Bouman, E. L. Miller, & I. Pollak (Eds.), *Computational Imaging IV*.

Ed(s): C. Bouman, E. Miller & I. Pollak

Event: Electronic Imaging 2006

author keywords: Compressed Sensing; sparsity; incoherent projections; random matrices; linear programming; imaging; camera

Sources: Crossref, ORCID

Added: March 22, 2019

2006 conference paper

An Architecture for Compressive Imaging

*2006 International Conference on Image Processing*. Presented at the 2006 International Conference on Image Processing.

Event: 2006 International Conference on Image Processing

author keywords: data acquisition; data compression; image coding; image sensors; video coding

Sources: Crossref, ORCID

Added: March 18, 2019

2006 conference paper

Analog-to-Information Conversion via Random Demodulation

*2006 IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software*. Presented at the 2006 IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software.

Event: 2006 IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software

Sources: Crossref, ORCID

Added: March 18, 2019

2006 conference paper

Coding vs. Packet Retransmission over Noisy Channels

*2006 40th Annual Conference on Information Sciences and Systems*. Presented at the 2006 40th Annual Conference on Information Sciences and Systems.

Event: 2006 40th Annual Conference on Information Sciences and Systems

author keywords: channel coding; cross-layer design; non-asymptotic information theory; packet networks; piecewise memoryless channels; universal channel coding

Sources: Crossref, ORCID

Added: March 18, 2019

2006 report

Compressed Sensing Reconstruction via Belief Propagation

(Technical Report No. ECE-0601). Electrical and Computer Engineering Department, Rice University.

Source: NC State University Libraries

Added: March 24, 2019

2006 conference paper

Compressive Imaging for Video Representation and Coding

*Proceedings of Picture Coding Symposium*. Presented at the PCS.

Event: PCS

Source: NC State University Libraries

Added: March 24, 2019

2006 conference paper

Distributed Compressed Sensing of Jointly Sparse Signals

*Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.* Presented at the Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Event: Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Sources: Crossref, ORCID

Added: March 23, 2019

2006 journal article

Faster sequential universal coding via block partitioning

*IEEE Transactions on Information Theory*, *52*(4), 1708–1710.

author keywords: lossless source coding; redundancy; sequential coding; universal coding

Sources: Crossref, ORCID

Added: March 20, 2019

2006 conference paper

Measurements vs. Bits: Compressed Sensing meets Information Theory

*Proceedings of 44th Allerton Conference on Communication, Control, and Computing*. Monticello, IL.

Source: NC State University Libraries

Added: March 23, 2019

2006 conference paper

Random Filters for Compressive Sampling and Reconstruction

*2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings*. Presented at the 2006 IEEE International Conference on Acoustics Speed and Signal Processing.

Event: 2006 IEEE International Conference on Acoustics Speed and Signal Processing

Sources: Crossref, ORCID

Added: March 23, 2019

2006 conference paper

Sudocodes – Fast Measurement and Reconstruction of Sparse Signals

*2006 IEEE International Symposium on Information Theory*. Presented at the 2006 IEEE International Symposium on Information Theory.

Event: 2006 IEEE International Symposium on Information Theory

Sources: Crossref, ORCID

Added: April 11, 2019

2006 conference paper

Universal distributed sensing via random projections

*2006 5th International Conference on Information Processing in Sensor Networks*. Presented at the The Fifth International Conference on Information Processing in Sensor Networks.

Event: The Fifth International Conference on Information Processing in Sensor Networks

Sources: Crossref, ORCID

Added: March 18, 2019

2006 conference paper

Variable-Rate Universal Slepian-Wolf Coding with Feedback

*Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.* Presented at the Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

Sources: Crossref, ORCID

Added: March 23, 2019

2005 conference paper

An Information-Theoretic Approach to Distributed Compressed Sensing

*Proceedings of 43d Allerton Conference on Communication, Control, and Computing*. Monticello, IL.

Source: NC State University Libraries

Added: March 24, 2019

2005 report

Analysis of the DCS One-Stage Greedy Algorithm for Common Sparse Supports

(Technical Report No. ECE-05-03). Electrical and Computer Engineering Department, Rice University.

Source: NC State University Libraries

Added: March 24, 2019

2005 journal article

Antisequential Suffix Sorting for BWT-Based Data Compression

*IEEE Transactions on Computers*, *54*(4), 385–397.

author keywords: Burrows Wheeler transform; data compression; source coding; suffix sorting; VLSI

Sources: Crossref, ORCID

Added: March 20, 2019

2005 conference paper

How quickly can we approach channel capacity?

*Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.* Presented at the Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.

Event: Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004.

Sources: Crossref, ORCID

Added: March 23, 2019

2005 conference paper

Joint Sparsity Models for Distributed Compressed Sensing

*Online Proceedings of the Workshop on Signal Processing with Adaptive Sparse Structured Representations*. Presented at the SPARS.

Event: SPARS

Source: NC State University Libraries

Added: March 24, 2019

2005 conference paper

Non-Asymptotic Performance of Symmetric Slepian-Wolf Coding

*Proceedings of 39th Annual Conference on Information Sciences and Systems*. Presented at the CISS 2005.

Event: CISS 2005

Source: NC State University Libraries

Added: March 24, 2019

2005 conference paper

Recovery of Jointly Sparse Signals from Few Random Projections

*Proceedings of Workshop on Neural Information Processing Systems*. Vancouver, Canada.

Source: NC State University Libraries

Added: March 24, 2019

2005 conference paper

Variable-Rate Coding with Feedback for Universal Communication Systems

*Proceedings of 43d Allerton Conference on Communication, Control, and Computing*. Monticello, IL.

Source: NC State University Libraries

Added: March 24, 2019

2004 journal article

An O(N) Semipredictive Universal Encoder via the BWT

*IEEE Transactions on Information Theory*, *50*(5), 928–937.

author keywords: Burrows-Wheeler transform (BWT); context tree pruning; data compression; dynamic programming; lossless source coding; minimum description length (MDL); suffix trees; tree sources; universal coding

Sources: Crossref, ORCID

Added: April 11, 2019

2004 report

Compressing Piecewise Smooth Multidimensional Functions Using Surflets: Rate-Distortion Analysis

[Technical Report]. Electrical and Computer Engineering Department, Rice University.

Source: NC State University Libraries

Added: March 24, 2019

2004 conference paper

Compression of Higher Dimensional Functions Containing Smooth Discontinuities

*Proceedings of 38th Annual Conference on Information Sciences and Systems*. Presented at the CISS 2004.

Event: CISS 2004

Source: NC State University Libraries

Added: March 24, 2019

2004 conference paper

Probability Assignments with Worst-Case Coding Length Constraints

*Proceedings of 38th Annual Conference on Information Sciences and Systems*. Presented at the CISS 2004.

Event: CISS 2004

Source: NC State University Libraries

Added: March 24, 2019

2004 conference paper

Redundancy Rates of Slepian-Wolf Coding

*Proceedings of 42d Allerton Conference on Communication, Control, and Computing*. Monticello, IL.

Source: NC State University Libraries

Added: March 24, 2019

2004 conference paper

Surflets: a sparse representation for multidimensional functions containing smooth discontinuities

*International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.* Presented at the International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.

Event: International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.

Sources: Crossref, ORCID

Added: March 23, 2019

2003 conference paper

Two-Part Codes with Low Worst-Case Redundancies for Distributed Compression of Bernoulli Sequences

*Proceedings of 37th Annual Conference on Information Sciences and Systems*. Presented at the CISS 2003.

Event: CISS 2003

Source: NC State University Libraries

Added: March 24, 2019

2002 journal article

Coding schemes for multislot messages in multichannel ALOHA with deadlines

*IEEE Transactions on Wireless Communications*, *1*(2), 292–301.

author keywords: coding; deadline; delay; energy-efficient design; multichannel ALOHA; reservation ALOHA; satellite

Sources: Crossref, ORCID

Added: March 20, 2019

2002 journal article

Multiple Working Points in Multichannel ALOHA with Deadlines

*Wireless Networks*, *8*(1), 5–11.

Source: NC State University Libraries

Added: March 23, 2019

2001 report

Linear Complexity MDL Universal Coding with the BWT

(Technical Report No. UILU-ENG-01-2213). Coordinated Science Laboratory, University of Illinois.

Source: NC State University Libraries

Added: March 24, 2019

2001 conference paper

Linear Complexity MDL Universal Coding with the BWT

Baron, D., & Bresler, Y. (2001, June). Presented at the Recent Results Session, IEEE International Symposium on Information Theory (ISIT2001).

Event: Recent Results Session, IEEE International Symposium on Information Theory (ISIT2001)

Source: NC State University Libraries

Added: March 25, 2019

2001 report

Multiround Coding and Coding-Reservation for Multislot Messages in Multichannel ALOHA with Deadlines

(Technical Report No. EE Pub 1293). Electrical Engineering Department, Technion.

Source: NC State University Libraries

Added: March 24, 2019

2001 journal article

On the cost of worst case coding length constraints

*IEEE Transactions on Information Theory*, *47*(7), 3088–3090.

author keywords: data compression; Fibonacci numbers; Huffman coding; redundancy; source coding; uniquely decodable

Sources: Crossref, ORCID

Added: March 20, 2019

2000 report

Capacity Maximization in Multichannel Slotted ALOHA with Deadlines - an Overview

(Technical Report No. EE Pub 1248, CCIT Report 314). Electrical Engineering Department, Technion.

Source: NC State University Libraries

Added: March 25, 2019

2000 report

Coding Schemes for Multislot Messages in Multichannel ALOHA with Deadlines

(Technical Report No. EE Pub 1241, CIT Report 307). Electrical Engineering Department, Technion.

Source: NC State University Libraries

Added: March 25, 2019

2000 report

Multiple Working Points in Multichannel ALOHA with Deadlines

(Technical Report No. EE Pub 1240, CCIT Report 306). Electrical Engineering Department, Technion.

Source: NC State University Libraries

Added: March 25, 2019

2000 report

On the Merits of Impure Multi-Copy Schemes for MultiChannel Slotted ALOHA with Deadlines

(Technical Report No. EE Pub 1249, CCIT Report 315). Electrical Engineering Department, Technion.

Source: NC State University Libraries

Added: March 25, 2019

2000 conference paper

Tree Source Identification with the Burrows Wheeler Transform

*Proceedings of 34th Annual Conference on Information Sciences and Systems*, *2*, FA1–10 - FS1–15. Princeton, NJ.

Event: CISS2000

Source: NC State University Libraries

Added: March 24, 2019

1999 conference paper

On the use of Multiple Working Points in Multichannel ALOHA with Deadlines

*Proceedings of 37th Allerton Conference on Communication, Control, and Computing*, 728–737. Monticello, IL.

Source: NC State University Libraries

Added: March 24, 2019