Skip header Section
Skip Bibliometrics Section
Information Theory: Coding Theorems for Discrete Memoryless SystemsJanuary 1982
- Authors:
- Imre Csiszar,
- Janos Korner
Abstract
No abstract available.
Cited By
- MolavianJazi E and Yener A (2019). Subset Source Coding, IEEE Transactions on Information Theory, 64:9, (5989-6012), Online publication date: 1-Sep-2018.
- Achiam J, Held D, Tamar A and Abbeel P Constrained policy optimization Proceedings of the 34th International Conference on Machine Learning - Volume 70, (22-31)
- Fillatre L (2017). Constructive minimax classification of discrete observations with arbitrary loss function, Signal Processing, 141:C, (322-330), Online publication date: 1-Dec-2017.
- Rey Vega L, Piantanida P and Hero A (2017). The Three-Terminal Interactive Lossy Source Coding Problem, IEEE Transactions on Information Theory, 63:1, (532-562), Online publication date: 1-Jan-2017.
Duchi J, Jordan M and Wainwright M (2014). Privacy Aware Learning, Journal of the ACM (JACM), 61:6, (1-57), Online publication date: 17-Dec-2014.- Viola E The communication complexity of addition Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, (632-651)
- Deppe C Rudolf Ahlswede 1938-2010 Information Theory, Combinatorics, and Search Theory, (735-738)
- Heup C L-identification for uniformly distributed sources and the q-ary identification entropy of second order Information Theory, Combinatorics, and Search Theory, (11-43)
- Bjelaković I, Boche H and Sommerfeld J Capacity results for arbitrarily varying wiretap channels Information Theory, Combinatorics, and Search Theory, (123-144)
- Blinovsky V and Cai M Classical-Quantum arbitrarily varying wiretap channel Information Theory, Combinatorics, and Search Theory, (234-246)
- Bjelaković I, Boche H, Janßen G and Nötzel J Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities Information Theory, Combinatorics, and Search Theory, (247-283)
- Haroutunian E and Hakobyan P Multiple objects Information Theory, Combinatorics, and Search Theory, (313-345)
- Mauduit C and Sárközy A Family complexity and VC-Dimension Information Theory, Combinatorics, and Search Theory, (346-363)
- Malyutov M Search for sparse active inputs Information Theory, Combinatorics, and Search Theory, (609-647)
- Gioran C and Kontoyiannis I (2018). Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases, Problems of Information Transmission, 48:4, (376-394), Online publication date: 1-Oct-2012.
- Ignatenko T and Willems F (2018). Biometric Security from an Information-Theoretical Perspective, Foundations and Trends in Communications and Information Theory, 7:2–3, (135-316), Online publication date: 1-Feb-2012.
- Luzzi L and Bloch M Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, (641-647)
- Villard J and Piantanida P Secure distributed lossless compression with side information at the eavesdropper Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, (665-672)
- Wyrembelski R, Bjelaković I, Oechtering T and Boche H (2018). Optimal coding strategies for bidirectional broadcast channels under channel uncertainty, IEEE Transactions on Communications, 58:10, (2984-2994), Online publication date: 1-Oct-2010.
- Checkoway S, Sarwate A and Shacham H Single-ballot risk-limiting audits using convex optimization Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections, (1-13)
- Sun Z, Tian C, Chen J and Wong K (2018). LDPC code design for asynchronous Slepian-Wolf coding, IEEE Transactions on Communications, 58:2, (511-520), Online publication date: 1-Feb-2010.
- Aeron S, Saligrama V and Zhao M (2019). Information theoretic bounds for compressed sensing, IEEE Transactions on Information Theory, 56:10, (5111-5130), Online publication date: 1-Oct-2010.
- Effros M, Goldsmith A and Liang Y (2010). Generalizing capacity, IEEE Transactions on Information Theory, 56:7, (3069-3087), Online publication date: 1-Jul-2010.
- Martín Á, Merhav N, Seroussi G and Weinberger M (2010). Twice-universal simulation of Markov sources and individual sequences, IEEE Transactions on Information Theory, 56:9, (4245-4255), Online publication date: 1-Sep-2010.
- Sun Z, Shao M, Chen J, Wong K and Wu X (2018). Achieving the rate-distortion bound with low-density generator matrix codes, IEEE Transactions on Communications, 58:6, (1643-1653), Online publication date: 1-Jun-2010.
- Verdú S and Shamai S (2010). Variable-rate channel capacity, IEEE Transactions on Information Theory, 56:6, (2651-2667), Online publication date: 1-Jun-2010.
- Muramatsu J and Miyake S (2010). Hash property and fixed-rate universal coding theorems, IEEE Transactions on Information Theory, 56:6, (2688-2698), Online publication date: 1-Jun-2010.
- Permuter H, Steinberg Y and Weissman T (2010). Two-way source coding with a helper, IEEE Transactions on Information Theory, 56:6, (2905-2919), Online publication date: 1-Jun-2010.
- Koch T and Lapidoth A (2010). On multipath fading channels at high SNR, IEEE Transactions on Information Theory, 56:12, (5945-5957), Online publication date: 1-Dec-2010.
- Weissman T (2010). The relationship between causal and noncausal mismatched estimation in continuous-time AWGN channels, IEEE Transactions on Information Theory, 56:9, (4256-4273), Online publication date: 1-Sep-2010.
- Cuff P, Permuter H and Cover T (2010). Coordination capacity, IEEE Transactions on Information Theory, 56:9, (4181-4206), Online publication date: 1-Sep-2010.
- Gündüz D, Simeone O, Goldsmith A, Poor H and Shamai S (2010). Multiple multicasts with the help of a relay, IEEE Transactions on Information Theory, 56:12, (6142-6158), Online publication date: 1-Dec-2010.
- Weissman T (2010). Capacity of channels with action-dependent states, IEEE Transactions on Information Theory, 56:11, (5396-5411), Online publication date: 1-Nov-2010.
- Sabbag E and Merhav N (2010). Achievable error exponents for channels with side information, IEEE Transactions on Information Theory, 56:11, (5424-5431), Online publication date: 1-Nov-2010.
- Sarwate A and Gastpar M (2010). Rateless codes for AVC models, IEEE Transactions on Information Theory, 56:7, (3105-3114), Online publication date: 1-Jul-2010.
- Kotagiri S and Laneman J (2010). Variations on information embedding in multiple access and broadcast channels, IEEE Transactions on Information Theory, 56:5, (2225-2240), Online publication date: 1-May-2010.
- Abbe E and Zheng L (2010). Linear universal decoding for compound channels, IEEE Transactions on Information Theory, 56:12, (5999-6013), Online publication date: 1-Dec-2010.
- Liu N, Gündüz D, Goldsmith A and Poor H (2010). Interference channels with correlated receiver side information, IEEE Transactions on Information Theory, 56:12, (5984-5998), Online publication date: 1-Dec-2010.
- Agarwal M, Guo D and Honig M (2010). Limited-rate channel state feedback for multicarrier block fading channels, IEEE Transactions on Information Theory, 56:12, (6116-6132), Online publication date: 1-Dec-2010.
- Ho S and Yeung R (2010). The interplay between entropy and variational distance, IEEE Transactions on Information Theory, 56:12, (5906-5929), Online publication date: 1-Dec-2010.
- Venkataramanan R and Pradhan S (2018). On computing the feedback capacity of channels and the feed-forward rate-distortion function of sources, IEEE Transactions on Communications, 58:7, (1889-1896), Online publication date: 1-Jul-2010.
- Ho S and Yeung R (2010). On information divergence measures and a unified typicality, IEEE Transactions on Information Theory, 56:12, (5893-5905), Online publication date: 1-Dec-2010.
- Como G (2010). Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels, IEEE Transactions on Information Theory, 56:9, (4321-4334), Online publication date: 1-Sep-2010.
- Gastpar M, Gill P, Huth A and Theunissen F (2019). Anthropic correction of information estimates and its application to neural coding, IEEE Transactions on Information Theory, 56:2, (890-900), Online publication date: 1-Feb-2010.
- Gohari A and Anantharam V (2019). Information-theoretic key agreement of multiple terminal, IEEE Transactions on Information Theory, 56:8, (3997-4010), Online publication date: 1-Aug-2010.
- Wu Y and Verdú S (2019). Rényi information dimension, IEEE Transactions on Information Theory, 56:8, (3721-3748), Online publication date: 1-Aug-2010.
- Hof E, Sason I and Shamai S (2019). Performance bounds for erasure, list and decision feedback schemes with linear block codes, IEEE Transactions on Information Theory, 56:8, (3754-3778), Online publication date: 1-Aug-2010.
- Gohari A and Anantharam V (2019). Information-theoretic key agreement of multiple terminals, IEEE Transactions on Information Theory, 56:8, (3973-3996), Online publication date: 1-Aug-2010.
- Fresia M and Caire G (2019). A linear encoding approach to index assignment in lossy source-channel coding, IEEE Transactions on Information Theory, 56:3, (1322-1344), Online publication date: 1-Mar-2010.
- Etkin R, Merhav N and Ordentlich E (2019). Error exponents of optimum decoding for the interference channel, IEEE Transactions on Information Theory, 56:1, (40-56), Online publication date: 1-Jan-2010.
- Eswaran K, Sarwate A, Sahai A and Gastpar M (2019). Zero-rate feedback can achieve the empirical capacity, IEEE Transactions on Information Theory, 56:1, (25-39), Online publication date: 1-Jan-2010.
- Zaidi A, Kotagiri S, Laneman J and Vandendorpe L (2010). Cooperative relaying with state available noncausally at the relay, IEEE Transactions on Information Theory, 56:5, (2272-2298), Online publication date: 1-May-2010.
- Verdú S (2019). Mismatched estimation and relative entropy, IEEE Transactions on Information Theory, 56:8, (3712-3720), Online publication date: 1-Aug-2010.
- Zaidi A and Vandendorpe L (2009). Lower bounds on the capacity of the relay channel with states at the source, EURASIP Journal on Wireless Communications and Networking, 2009, (1-22), Online publication date: 1-Jan-2009.
- Mathar R and Schmeink A (2009). Saddle-point properties and nash equilibria for channel games, EURASIP Journal on Advances in Signal Processing, 2009, (1-15), Online publication date: 1-Jan-2009.
- Wyrembelski R, Bjelakovic I and Boche H Coding strategies for bidirectional relaying for arbitrarily varying channels Proceedings of the 28th IEEE conference on Global telecommunications, (1235-1240)
- Choi S (2009). Lossy distributed source coding using graphs, IEEE Communications Letters, 13:4, (262-264), Online publication date: 1-Apr-2009.
- Como G and Yüksel S On the capacity of finite state multiple access channels with asymmetric partial state feedback Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, (589-594)
- Zhong Y, Alajaji F and Campbell L (2009). Joint source-channel coding excess distortion exponent for some memoryless continuous-alphabet systems, IEEE Transactions on Information Theory, 55:3, (1296-1319), Online publication date: 1-Mar-2009.
- Kimura A, Uyematsu T, Kuzuoka S and Watanabe S (2009). Universal source coding over generalized complementary delivery networks, IEEE Transactions on Information Theory, 55:3, (1360-1373), Online publication date: 1-Mar-2009.
- Luo Z and Devetak I (2009). Channel simulation with quantum side information, IEEE Transactions on Information Theory, 55:3, (1331-1342), Online publication date: 1-Mar-2009.
- Chen J, He D and Jagmohan A (2018). The equivalence between Slepian-Wolf coding and channel coding under density evolution, IEEE Transactions on Communications, 57:9, (2534-2540), Online publication date: 1-Sep-2009.
- Gündüz D, Erkip E, Goldsmith A and Poor H (2009). Source and channel coding for correlated sources over multiuser channels, IEEE Transactions on Information Theory, 55:9, (3927-3944), Online publication date: 1-Sep-2009.
- Piantanida P, Matz G and Duhamel P (2009). Outage behavior of discrete memoryless channels under channel estimation errors, IEEE Transactions on Information Theory, 55:9, (4221-4239), Online publication date: 1-Sep-2009.
- Piantanida P, Sadough S and Duhamel P (2018). On the outage capacity of a practical decoder accounting for channel estimation inaccuracies, IEEE Transactions on Communications, 57:5, (1341-1350), Online publication date: 1-May-2009.
- Perron E, Diggavi S and Telatar E The interference-multiple-access channel Proceedings of the 2009 IEEE international conference on Communications, (1611-1615)
- Ryabko B (2009). Compression-based methods for nonparametric prediction and estimation of some characteristics of time series, IEEE Transactions on Information Theory, 55:9, (4309-4315), Online publication date: 1-Sep-2009.
- Chen J, He D and Jagmohan A (2009). On the duality between Slepian-Wolf coding and channel coding under mismatched decoding, IEEE Transactions on Information Theory, 55:9, (4006-4018), Online publication date: 1-Sep-2009.
- Draper S, Kschischang F and Frey B (2009). Rateless coding for arbitrary channel mixtures with decoder channel state information, IEEE Transactions on Information Theory, 55:9, (4119-4133), Online publication date: 1-Sep-2009.
- Ignatenko T and Willems F (2019). Biometric systems, IEEE Transactions on Information Forensics and Security, 4:4, (956-973), Online publication date: 1-Dec-2009.
- Permuter H, Weissman T and Chen J (2019). Capacity region of the finite-state multiple-access channel with and without feedback, IEEE Transactions on Information Theory, 55:6, (2455-2477), Online publication date: 1-Jun-2009.
- Philosof T and Zamir R (2019). On the loss of single-letter characterization, IEEE Transactions on Information Theory, 55:6, (2442-2454), Online publication date: 1-Jun-2009.
- Tchamkerten A, Chandar V and Wornell G (2019). Communication under strong asynchronism, IEEE Transactions on Information Theory, 55:10, (4508-4528), Online publication date: 1-Oct-2009.
- Zhong Y, Alajaji F and Linder T (2019). Random-coding lower bounds for the error exponent of joint quantization and watermarking systems, IEEE Transactions on Information Theory, 55:7, (3264-3283), Online publication date: 1-Jul-2009.
- Moulin P (2019). A Neyman-Pearson approach to universal erasure and list decoding, IEEE Transactions on Information Theory, 55:10, (4462-4478), Online publication date: 1-Oct-2009.
- Sanderovich A, Shamai S and Steinberg Y (2019). Distributed MIMO receiver, IEEE Transactions on Information Theory, 55:10, (4419-4438), Online publication date: 1-Oct-2009.
- Bjelakovic I and Boche H (2019). Classical capacities of compound and averaged quantum channels, IEEE Transactions on Information Theory, 55:7, (3360-3374), Online publication date: 1-Jul-2009.
- Marco D and Effros M (2019). On lossless coding with coded side information, IEEE Transactions on Information Theory, 55:7, (3284-3296), Online publication date: 1-Jul-2009.
- Tuncel E (2019). Capacity/storage tradeoff in high-dimensional identification systems, IEEE Transactions on Information Theory, 55:5, (2097-2106), Online publication date: 1-May-2009.
- Lapidoth A and Moser S (2019). On the capacity of the discrete-time poisson channel, IEEE Transactions on Information Theory, 55:1, (303-322), Online publication date: 1-Jan-2009.
- Tuncel E, Nayak J, Koulgi P and Rose K (2019). On complementary graph entropy, IEEE Transactions on Information Theory, 55:6, (2537-2546), Online publication date: 1-Jun-2009.
- Niesen U and Tchamkerten A (2019). Tracking stopping times through noisy observations, IEEE Transactions on Information Theory, 55:1, (422-432), Online publication date: 1-Jan-2009.
- Merhav N (2019). Relations between random coding exponents and the statistical physics of random codes, IEEE Transactions on Information Theory, 55:1, (83-92), Online publication date: 1-Jan-2009.
- Merhav N and Weinberger M (2019). Universal simulation with fidelity criteria, IEEE Transactions on Information Theory, 55:1, (292-302), Online publication date: 1-Jan-2009.
- Krithivasan D and Pradhan S (2019). Lattices for distributed source coding, IEEE Transactions on Information Theory, 55:12, (5628-5651), Online publication date: 1-Dec-2009.
- Ho S and Yeung R (2019). On the discontinuity of the Shannon information measures, IEEE Transactions on Information Theory, 55:12, (5362-5374), Online publication date: 1-Dec-2009.
- Merhav N (2019). Joint source channel coding via statistical mechanics, IEEE Transactions on Information Theory, 55:12, (5382-5393), Online publication date: 1-Dec-2009.
- Como G, Yüksel S and Tatikonda S (2019). The error exponent of variable-length codes over Markov channels with feedback, IEEE Transactions on Information Theory, 55:5, (2139-2160), Online publication date: 1-May-2009.
- Chen J, He D, Jagmohan A, Lastras-Montaño L and Yang E (2019). On the linear codebook-level duality between Slepian-Wolf coding and channel coding, IEEE Transactions on Information Theory, 55:12, (5575-5590), Online publication date: 1-Dec-2009.
- Gupta A and Verdú S (2019). Nonlinear sparse-graph codes for lossy compression, IEEE Transactions on Information Theory, 55:5, (1961-1975), Online publication date: 1-May-2009.
- Rost P and Fettweis G (2019). Analysis of a mixed strategy for multiple relay networks, IEEE Transactions on Information Theory, 55:1, (174-189), Online publication date: 1-Jan-2009.
- Shrader B and Permuter H (2019). Feedback capacity of the compound channel, IEEE Transactions on Information Theory, 55:8, (3629-3644), Online publication date: 1-Aug-2009.
- Hayashi M (2019). Information spectrum approach to second-order coding rate in channel coding, IEEE Transactions on Information Theory, 55:11, (4947-4966), Online publication date: 1-Nov-2009.
- Burshtein D (2019). Iterative approximate linear programming decoding of LDPC codes with linear complexity, IEEE Transactions on Information Theory, 55:11, (4835-4859), Online publication date: 1-Nov-2009.
- Liu N and Goldsmith A (2019). Capacity regions and bounds for a class of Z-interference channels, IEEE Transactions on Information Theory, 55:11, (4986-4994), Online publication date: 1-Nov-2009.
- Borade S, Nakiboǧlu B and Zheng L (2019). Unequal error protection, IEEE Transactions on Information Theory, 55:12, (5511-5539), Online publication date: 1-Dec-2009.
- Liang Y, Somekh-Baruch A, Poor H, Shamai S and Verdú S (2019). Capacity of cognitive interference channels with and without secrecy, IEEE Transactions on Information Theory, 55:2, (604-619), Online publication date: 1-Feb-2009.
- Lai L, El Gamal H and Poor H (2019). Authentication over noisy channels, IEEE Transactions on Information Theory, 55:2, (906-916), Online publication date: 1-Feb-2009.
- Motahari A and Khandani A (2019). Capacity bounds for the Gaussian interference channel, IEEE Transactions on Information Theory, 55:2, (620-643), Online publication date: 1-Feb-2009.
- Zhong Y, Alajaji F and Campbell L (2019). Error exponents for asymmetric two-user discrete memoryless source-channel coding systems, IEEE Transactions on Information Theory, 55:4, (1487-1518), Online publication date: 1-Apr-2009.
- Akirav Y and Merhav N (2019). Exact characterization of the minimax loss in error exponents of universal decoders, IEEE Transactions on Information Theory, 55:4, (1440-1459), Online publication date: 1-Apr-2009.
- Yang S, Chen Y and Qiu P (2019). Linear-codes-based lossless joint source-channel coding for multiple-access channels, IEEE Transactions on Information Theory, 55:4, (1468-1486), Online publication date: 1-Apr-2009.
- Körner J, Simonyi G and Sinaimeri B (2009). On types of growth for graph-different permutations, Journal of Combinatorial Theory Series A, 116:3, (713-723), Online publication date: 1-Apr-2009.
- Steinberg Y (2019). Coding and common reconstruction, IEEE Transactions on Information Theory, 55:11, (4995-5010), Online publication date: 1-Nov-2009.
- Miyake S and Muramatsu J (2018). A Construction of Lossy Source Code Using LDPC Matrices, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E91-A:6, (1488-1501), Online publication date: 1-Jun-2008.
- Johansson A, Kahn J and Vu V (2008). Factors in random graphs, Random Structures & Algorithms, 33:1, (1-28), Online publication date: 1-Aug-2008.
- Kuzuoka S (2018). On the Suboptimality of Linear Lossy Codes, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E91-A:10, (2868-2869), Online publication date: 1-Oct-2008.
- Payaro M, Pascual-Iserte A and Angel Lagunas M (2019). Mutual Information Optimization and Capacity Evaluation in MIMO Systems with Magnitude Knowledge and Phase Uncertainty, Circuits, Systems, and Signal Processing, 26:4, (527-549), Online publication date: 1-Aug-2007.
- Oohama Y (2018). Intrinsic Randomness Problem in the Framework of Slepian-Wolf Separate Coding System, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:7, (1406-1417), Online publication date: 1-Jul-2007.
- Miyake S and Maruyama M (2018). Construction of Universal Codes Using LDPC Matrices and Their Error Exponents, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:9, (1830-1839), Online publication date: 1-Sep-2007.
- Kimura A, Uyematsu T and Kuzuoka S (2018). Universal Coding for Correlated Sources with Complementary Delivery, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:9, (1840-1847), Online publication date: 1-Sep-2007.
- Khosravifard M, Fooladivanda D and Gulliver T (2018). Confliction of the Convexity and Metric Properties in f-Divergences, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:9, (1848-1853), Online publication date: 1-Sep-2007.
- Fabris F, Sgarro A and Tossi A (2018). Splitting the BLOSUM score into numbers of biological significance, EURASIP Journal on Bioinformatics and Systems Biology, 2007, (6-6), Online publication date: 1-Jan-2007.
- Ahlswede R and Cai N Codes with the identifiable parent property and the multiple-access channel General Theory of Information Transfer and Combinatorics, (249-257)
- Ahlswede R and Cai N Search with noisy and delayed responses General Theory of Information Transfer and Combinatorics, (695-703)
- Ahlswede R and Cai N Watermarking identification codes with related topics on common randomness General Theory of Information Transfer and Combinatorics, (107-153)
- Haroutunian M Bounds of E-capacity for multiple-access channel with random parameter General Theory of Information Transfer and Combinatorics, (196-217)
- Ahlswede R On concepts of performance parameters for channels General Theory of Information Transfer and Combinatorics, (639-663)
- Kleinewächter C On identification General Theory of Information Transfer and Combinatorics, (62-83)
- Ahlswede R Introduction General Theory of Information Transfer and Combinatorics, (1-44)
- Ahlswede R and Haroutunian E On logarithmically asymptotically optimal testing of hypotheses and identification General Theory of Information Transfer and Combinatorics, (553-571)
- Ahlswede R, Aloyan E and Haroutunian E On logarithmically asymptotically optimal hypothesis testing for arbitrarily varying sources with side information General Theory of Information Transfer and Combinatorics, (547-552)
- Katona G and Tichler K Some contributions to the minimum representation problem of key systems Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems, (240-257)
- Iwata K, Ikeda K and Sakai H (2006). The asymptotic equipartition property in reinforcement learning and its relation to return maximization, Neural Networks, 19:1, (62-75), Online publication date: 1-Jan-2006.
- Van Le T and Kurosawa K Bandwidth optimal steganography secure against adaptive chosen stegotext attacks Proceedings of the 8th international conference on Information hiding, (297-313)
- Harutyunyan A Notes on conditions for successive refinement of information General Theory of Information Transfer and Combinatorics, (154-164)
- Zhang Z A simplified method for computing the key equivocation for additive-like instantaneous block encipherers General Theory of Information Transfer and Combinatorics, (276-284)
- Ahlswede R and Zhang Z Estimating with randomized encoding the joint empirical distribution in a correlated source General Theory of Information Transfer and Combinatorics, (535-546)
- Pinsker M (2005). On Estimation of Information via Variation, Problems of Information Transmission, 41:2, (71-75), Online publication date: 1-Apr-2005.
- Sarshar N and Wu X Optimal channel rate allocation for multimedia communication over fading wireless channels Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling, (8-15)
- Chiang M (2018). Geometric programming for communication systems, Communications and Information Theory, 2:1/2, (1-154), Online publication date: 1-Jul-2005.
- Gharavi R and Anantharam V (2005). An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices, Theoretical Computer Science, 332:1-3, (543-557), Online publication date: 28-Feb-2005.
- Spellman E and Vemuri B Efficient shape indexing using an information theoretic representation Proceedings of the 4th international conference on Image and Video Retrieval, (145-153)
- Khalili R and Salamatian K A New Relaying Scheme for Cheap Wireless Relay Nodes Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, (197-206)
- Cai N, Winter A and Yeung R (2018). Quantum privacy and quantum wiretap channels, Problems of Information Transmission, 40:4, (318-336), Online publication date: 1-Oct-2004.
- Cachin C (2004). An information-theoretic model for steganography, Information and Computation, 192:1, (41-56), Online publication date: 1-Jul-2004.
- Taneja I and Kumar P (2019). Relative information of type s, Csiszár's f-divergence, and information inequalities, Information Sciences: an International Journal, 166:1-4, (105-125), Online publication date: 29-Oct-2004.
- V'Yugin V and Maslov V (2019). Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity, Problems of Information Transmission, 39:4, (380-394), Online publication date: 1-Oct-2003.
- Peikert C, shelat A and Smith A Lower bounds for collusion-secure fingerprinting Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (472-479)
- Liu X, Srivastava A and Wang D (2003). Intrinsic generalization analysis of low dimensional representations, Neural Networks, 16:5-6, (537-545), Online publication date: 1-Jun-2003.
- Tapia E, González J and García-Villalba J Good error correcting output codes for adaptive multiclass learning Proceedings of the 4th international conference on Multiple classifier systems, (156-165)
- Dumer I, Pinsker M and Prelov V (2018). Epsilon-entropy of an Ellipsoid in a Hamming Space, Problems of Information Transmission, 38:1, (1-15), Online publication date: 1-Jan-2002.
- Tuncel E, Koulgi P, Regunathan S and Rose K Zero-Error Source Coding with Maximum Distortion Criterion Proceedings of the Data Compression Conference
- Balakirsky V (2018). Joint Source-Channel Coding Using Variable-Length Codes, Problems of Information Transmission, 37:1, (10-23), Online publication date: 1-Jan-2001.
- Cheng C, Fu A and Zhang Y Entropy-based subspace clustering for mining numerical data Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, (84-93)
- Foschini G and Gans M (1998). On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas, Wireless Personal Communications: An International Journal, 6:3, (311-335), Online publication date: 1-Mar-1998.
- Csirmaz L (1997). The Size of a Share Must Be Large, Journal of Cryptology, 10:4, (223-231), Online publication date: 1-Sep-1997.
- Raz R A parallel repetition theorem Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (447-456)
- Béguin P and Cresti A General short computational secret sharing schemes Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques, (194-208)
- Höffgen K Learning and robust learning of product distributions Proceedings of the sixth annual conference on Computational learning theory, (77-83)
- Turán G Lower bounds for PAC learning with queries Proceedings of the sixth annual conference on Computational learning theory, (384-391)
- Paaß G MESA Proceedings of the Eighth international conference on Uncertainty in artificial intelligence, (230-237)
- Boppana R Optimal separations between concurrent-write parallel machines Proceedings of the twenty-first annual ACM symposium on Theory of computing, (320-326)
- Ben-Tal A and Teboulle M (1988). Extension of some results for channel capacity using a generalized information measure, Applied Mathematics and Optimization, 17:1, (121-132), Online publication date: 1-Jan-1988.
- Fuja T and Heegard C (1986). Row/Column Replacement for the Control of Hard Defects in Semiconductor RAM's, IEEE Transactions on Computers, 35:11, (996-1000), Online publication date: 1-Nov-1986.
- Sgarro A Equivocations for homophonic ciphers Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques, (51-61)
Recommendations
Information theory: The copernican system of communications
IT IS ARGUED that Shannon's theory of information is the scientific basis of commumcataons in the same sense that Copernicus' heliocentric theory is the scientific basis of astronomy. Some parallels between Copernicus and Shannon are drawn. It is ...
Application of Holder's inequality in information theory
Two coding theorems for two 'useful' measures have been proved by using Holder's inequality. The measures considered for decipherable codes are: H α (P β ; U) = 1/(1 - α) log Σ i=1 n (P i βα U i /Σ i=1 n P i βα U i ) for power distribution and 'useful'...