{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:46:03Z","timestamp":1775054763037,"version":"3.50.1"},"reference-count":66,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T00:00:00Z","timestamp":1657756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Digital communication receivers extract information about the transmitted data from the received signal in subsequent processing steps, such as synchronization, demodulation and channel decoding. Technically, the receiver-side signal processing for conducting these tasks is complex and hence causes bottleneck situations in terms of power, delay and chip area. Typically, many bits per sample are required to represent and process the received signal in the digital receiver hardware accurately. In addition, demanding arithmetical operations are required in the signal processing algorithms. A popular recent trend is designing entire receiver chains or some of their crucial building blocks from an information theoretical perspective. Signal processing blocks with very simple mathematical operations can be designed to directly maximize the relevant information that flows through them. At the same time, a strong quantization reduces the number of bits processed in the receiver to further lower the complexity. The described system design approach follows the principle of the information bottleneck method. Different authors proposed various ideas to design and implement mutual information-maximizing signal processing units. The first important aim of this article is to explain the fundamental similarities between the information bottleneck method and the functionalities of communication receivers. Based on that, we present and investigate new results on an entire receiver chain that is designed following the information bottleneck design principle. Afterwards, we give an overview of different techniques following the information bottleneck design paradigm from the literature, mainly dealing with channel decoding applications. We analyze the similarities of the different approaches for information bottleneck signal processing. This comparison leads to a general view on information bottleneck signal processing which goes back to the learning of parameters of trainable functions that maximize the relevant mutual information under compression.<\/jats:p>","DOI":"10.3390\/e24070972","type":"journal-article","created":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T00:17:10Z","timestamp":1657844230000},"page":"972","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Information Bottleneck Signal Processing and Learning to Maximize Relevant Information for Communication Receivers"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7945-3528","authenticated-orcid":false,"given":"Jan","family":"Lewandowsky","sequence":"first","affiliation":[{"name":"Fraunhofer Institute for Communication, Information Processing and Ergonomics, Fraunhoferstra\u00dfe 20, 53343 Wachtberg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Bauch","sequence":"additional","affiliation":[{"name":"Institute of Communications, Hamburg University of Technology, Ei\u00dfendorfer Stra\u00dfe 40, 21073 Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-5895","authenticated-orcid":false,"given":"Maximilian","family":"Stark","sequence":"additional","affiliation":[{"name":"Institute of Communications, Hamburg University of Technology, Ei\u00dfendorfer Stra\u00dfe 40, 21073 Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A Mathematical Theory of Communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"ref_2","unstructured":"Tishby, N., Pereira, F.C., and Bialek, W. (1999, January 22\u201324). The information bottleneck method. Proceedings of the 37th Allerton Conference on Communication and Computation, Monticello, NY, USA."},{"key":"ref_3","unstructured":"Slonim, N. (2002). The Information Bottleneck: Theory and Applications. [Ph.D. Thesis, Hebrew University]."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1046\/j.1365-8711.2001.04125.x","article-title":"Objective classification of galaxy spectra using the information bottleneck method","volume":"323","author":"Slonim","year":"2001","journal-title":"Mon. Not. R. Astron. Soc."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1109\/TIP.2009.2017823","article-title":"Image segmentation using information bottleneck method","volume":"18","author":"Bardera","year":"2009","journal-title":"IEEE Trans. Image Process."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1587","DOI":"10.3390\/e15051587","article-title":"Function identification in neuron populations via information bottleneck","volume":"15","author":"Buddha","year":"2013","journal-title":"Entropy"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Zaidi, A., Agueri, I.-E., and Shamai, S. (2020). On the information bottleneck problems, connections, applications and information theoretic views. Entropy, 22.","DOI":"10.3390\/e22020151"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/JSAIT.2020.2991561","article-title":"The information bottleneck problem and its applications in machine learning","volume":"1","author":"Goldfeld","year":"2020","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Zeitler, G. (October, January 29). Low-precision analog-to-digital conversion and mutual information in channels with memory. Proceedings of the 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton\u20192010), Monticello, NY, USA.","DOI":"10.1109\/ALLERTON.2010.5706982"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2511","DOI":"10.1109\/TCOMM.2012.071312.110682","article-title":"Low-precision A\/D conversion for maximum information rate in channels with memory","volume":"60","author":"Zeitler","year":"2012","journal-title":"IEEE Trans. Commun."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"4544","DOI":"10.1109\/TIT.2014.2327016","article-title":"Quantization of binary-input discrete memoryless channels","volume":"60","author":"Kurkoski","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Kurkoski, B.M., Yamaguchi, K., and Kobayashi, K. (December, January 30). Noise thresholds for discrete LDPC decoding mappings. Proceedings of the 2008 IEEE Global Telecommunications Conference (GLOBECOM\u20192008), New Orleans, LA, USA.","DOI":"10.1109\/GLOCOM.2008.ECP.214"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Meidlinger, M., Balatsoukas-Stimming, A., Burg, A., and Matz, G. (2015, January 8\u201311). Quantized message passing for LDPC codes. Proceedings of the 2015 49th Asilomar Conference on Signals, Systems and Computers (ACSSC\u20192015), Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2015.7421419"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., and Bauch, G. (2015, January 14\u201316). Trellis based node operations for LDPC decoders from the information bottleneck method. Proceedings of the 2015 9th International Conference on Signal Processing and Communication Systems (ICSPCS\u20192015), Cairns, Australia.","DOI":"10.1109\/ICSPCS.2015.7391731"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2391","DOI":"10.1109\/JSAC.2016.2603708","article-title":"LDPC decoding mappings that maximize mutual information","volume":"34","author":"Romero","year":"2016","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., Stark, M., and Bauch, G. (2016, January 22\u201327). Optimum message mapping LDPC decoders derived from the sum-product algorithm. Proceedings of the 2016 IEEE International Conference on Communications (ICC\u20192016), Kuala Lumpur, Malaysia.","DOI":"10.1109\/ICC.2016.7510906"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Meidlinger, M., and Matz, G. (2017, January 3\u20136). On irregular LDPC codes with quantized message passing decoding. Proceedings of the 2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC\u20192017), Sapporo, Japan.","DOI":"10.1109\/SPAWC.2017.8227780"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"4054","DOI":"10.1109\/ACCESS.2018.2797694","article-title":"Information-optimum LDPC decoders based on the information bottleneck method","volume":"6","author":"Lewandowsky","year":"2018","journal-title":"IEEE Access"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Stark, M., Lewandowsky, J., and Bauch, G. (2018, January 9\u201313). Information-optimum LDPC decoders with message alignment for irregular codes. Proceedings of the 2018 IEEE Global Communications Conference (GLOBECOM\u20192018), Abu Dhabi, United Arab Emirates.","DOI":"10.1109\/GLOCOM.2018.8648053"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Stark, M., Lewandowsky, J., and Bauch, G. (2018). Information-bottleneck decoding of high-rate irregular LDPC codes for optical communication using message alignment. Appl. Sci., 8.","DOI":"10.3390\/app8101884"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Stark, M., Bauch, G., and Lewandowsky, J. (2019, January 20\u201324). Decoding of non-binary LDPC codes using the information bottleneck method. Proceedings of the 2019 IEEE International Conference on Communications (ICC\u20192019), Shanghai, China.","DOI":"10.1109\/ICC.2019.8761712"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1109\/TCOMM.2019.2944159","article-title":"Design and decoding of irregular LDPC codes based on discrete message passing","volume":"68","author":"Meidlinger","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1587\/transcom.2018TTI0001","article-title":"Design and evaluation of information bottleneck LDPC decoders for digital signal processors","volume":"E102-B","author":"Lewandowsky","year":"2019","journal-title":"IEICE Trans. Commun."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"He, X., Cai, K., and Mei, Z. (2019). Mutual information-maximizing quantized belief propagation decoding of regular LDPC codes. arXiv.","DOI":"10.1109\/GLOBECOM38437.2019.9013335"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"He, X., Cai, K., and Mei, Z. (2019, January 9\u201313). On mutual information-maximizing quantized belief propagation decoding of LDPC codes. Proceedings of the 2019 IEEE Global Communications Conference (GLOBECOM\u20192019), Waikoloa, HI, USA.","DOI":"10.1109\/GLOBECOM38437.2019.9013335"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Stark, M., Bauch, G., Wang, L., and Wesel, R. (2020, January 7\u201311). Information bottleneck decoding of rate-compatible 5G-LDPC codes. Proceedings of the 2020 IEEE International Conference on Communications (ICC\u20192020), Taipei, Taiwan.","DOI":"10.1109\/ICC40277.2020.9149304"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/OJCOMS.2020.2994048","article-title":"Decoding rate-compatible 5G-LDPC codes with coarse quantization using the information bottleneck method","volume":"1","author":"Stark","year":"2020","journal-title":"IEEE Open J. Commun. Soc."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Stark, M., Lewandowsky, J., and Bauch, G. (2020, January 14\u201316). Neural information bottleneck decoding. Proceedings of the 2020 14th International Conference on Signal Processing and Communication Systems (ICSPCS\u20192020), Adelaide, Australia.","DOI":"10.1109\/ICSPCS50536.2020.9310014"},{"key":"ref_29","unstructured":"Stark, M. (2021). Machine Learning for Reliable Communication under Coarse Quantization. [Ph.D. Dissertation, Hamburg University of Technology]."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Mohr, P., and Bauch, G. (2021, January 14\u201323). Coarsely Quantized Layered Decoding Using the Information Bottleneck Method. Proceedings of the 2021 IEEE International Conference on Communications (ICC\u20192021), Montreal, QC, Canada.","DOI":"10.1109\/ICC42927.2021.9500593"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1109\/TCOMM.2022.3149913","article-title":"Reconstruction-Computation-Quantization (RCQ): A Paradigm for Low Bit Width LDPC Decoding","volume":"70","author":"Wang","year":"2022","journal-title":"IEEE Trans. Commun."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Stark, M., Shah, A., and Bauch, G. (2018, January 15\u201318). Polar code construction using the information bottleneck method. Proceedings of the 2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW\u20192018), Barcelona, Spain.","DOI":"10.1109\/WCNCW.2018.8368978"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Shah, S.A.A., Stark, M., and Bauch, G. (2019, January 11\u201314). Design of quantized decoders for polar codes using the information bottleneck method. Proceedings of the 12th International ITG Conference on Systems, Communications and Coding 2019 (SCC\u20192019), Rostock, Germany.","DOI":"10.3390\/a12090192"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Shah, S.A.A., Stark, M., and Bauch, G. (2019). Coarsely Quantized Decoding and Construction of Polar Codes Using the Information Bottleneck Method. Algorithms, 12.","DOI":"10.3390\/a12090192"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., Stark, M., and Bauch, G. (2016, January 10\u201315). Information bottleneck graphs for receiver design. Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT\u20192016), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541827"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., Stark, M., and Bauch, G. (2017, January 25\u201330). Message alignment for discrete LDPC decoders with quadrature amplitude modulation. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT\u20192017), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8007065"},{"key":"ref_37","unstructured":"Lewandowsky, J., Stark, M., Mendrzik, R., and Bauch, G. (2017, January 6\u20139). Discrete channel estimation by integer passing in information bottleneck graphs. Proceedings of the 2017 11th International ITG Conference on Systems, Communications and Coding (SCC\u20192017), Hamburg, Germany."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Bauch, G., Lewandowsky, J., Stark, M., and Oppermann, P. (2018, January 3\u20136). Information-optimum discrete signal processing for detection and decoding. Proceedings of the 2018 IEEE 87th Vehicular Technology Conference (VTC Spring), Porto, Portugal.","DOI":"10.1109\/VTCSpring.2018.8417508"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"7911","DOI":"10.1109\/TCOMM.2020.3019447","article-title":"Forward-aware information bottleneck-based vector quantization for noisy channels","volume":"68","author":"Hassanpour","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"6633","DOI":"10.1109\/TCOMM.2021.3097142","article-title":"Forward-aware information bottleneck-based vector quantization: Multiterminal extensions for parallel and successive retrieval","volume":"69","author":"Hassanpour","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Zeitler, G., Koetter, R., Bauch, G., and Widmer, J. (2008, January 1\u20135). Design of network coding functions in multihop relay networks. Proceedings of the 5th International Symposium on Turbo Codes and Related Topics (ISTC\u20192008), Lausanne, Switzerland.","DOI":"10.1109\/TURBOCODING.2008.4658706"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Zeitler, G., Koetter, R., Bauch, G., and Widmer, J. (2009, January 14\u201318). On quantizer design for soft values in the multiple-access relay channel. Proceedings of the IEEE International Conference on Communications (ICC\u20192009), Dresden, Germany.","DOI":"10.1109\/ICC.2009.5199246"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Winkelbauer, A., and Matz, G. (2012, January 10\u201315). Joint network-channel coding for the asymmetric multiple-access relay channel. Proceedings of the IEEE International Conference on Communications (ICC\u20192012), Ottawa, ON, Canada.","DOI":"10.1109\/ICC.2012.6364440"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Winkelbauer, A., and Matz, G. (2012, January 2\u20134). Joint network-channel coding in the multiple-access relay channel: Beyond two sources. Proceedings of the 5th International Symposium on Communications, Control and Signal Processing, Rome, Italy.","DOI":"10.1109\/ISCCSP.2012.6217859"},{"key":"ref_45","unstructured":"Kern, D., and K\u00fchn, V. (2016, January 9\u201311). Practical aspects of compress and forward with BICM in the 3-node relay channel. Proceedings of the 20th International ITG Workshop on Smart Antennas (WSA), Munich, Germany."},{"key":"ref_46","unstructured":"Kern, D., and K\u00fchn, V. (2017, January 6\u20139). On compress and forward with multiple carriers in the 3-node relay channel exploiting information bottleneck graphs. Proceedings of the 11th International ITG Conference on Systems, Communications and Coding (SCC\u20192017), Hamburg, Germany."},{"key":"ref_47","unstructured":"Kern, D., and K\u00fchn, V. (2017, January 15\u201317). On implicit and explicit channel estimation for compress and forward relaying OFDM schemes designed by information bottleneck graphs. Proceedings of the 21th International ITG Workshop on Smart Antennas (WSA\u20192017), Berlin, Germany."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Chen, D., and K\u00fchn, V. (2016, January 22\u201327). Alternating information bottleneck optimization for the compression in the uplink of C-RAN. Proceedings of the 2016 IEEE International Conference on Communications (ICC\u20192016), Kuala Lumpur, Malaysia.","DOI":"10.1109\/ICC.2016.7510694"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Stark, M., Lewandowsky, J., and Bauch, G. (2018, January 3\u20136). Iterative message alignment for quantized message passing between distributed sensor nodes. Proceedings of the 2018 IEEE 87th Vehicular Technology Conference (VTC Spring\u20192018), Porto, Portugal.","DOI":"10.1109\/VTCSpring.2018.8417672"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Steiner, S., and K\u00fchn, V. (2021, January 14\u201323). Distributed compression using the information bottleneck principle. Proceedings of the 2021 IEEE International Conference on Communications (ICC\u20192021), Montreal, QC, Canada.","DOI":"10.1109\/ICC42927.2021.9500324"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Steiner, S., K\u00fchn, V., Stark, M., and Bauch, G. (2021, January 11\u201314). Reduced-complexity greedy distributed information bottleneck algorithm. Proceedings of the 2021 IEEE Statistical Signal Processing Workshop (SSP\u20192021), Rio de Janeiro, Brazil.","DOI":"10.1109\/SSP49050.2021.9513805"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1109\/OJCOMS.2021.3083569","article-title":"Reduced-complexity optimization of distributed quantization using the information bottleneck principle","volume":"2","author":"Steiner","year":"2021","journal-title":"IEEE Open J. Commun. Soc."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Steiner, S., Aminu, A.D., and K\u00fchn, V. (2022). Distributed quantization for partially cooperating sensors using the information bottleneck method. Entropy, 24.","DOI":"10.3390\/e24040438"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TPAMI.2019.2928806","article-title":"Distributed variational representation learning","volume":"43","author":"Aguerri","year":"2021","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Moldoveanu, M., and Zaidi, A. (2021, January 27\u201330). On In-network learning. A comparative study with federated and split learning. Proceedings of the 2021 IEEE 22nd International Workshop on Signal Processing Advances in Wireless Communications (SPAWC\u20192021), Lucca, Italy.","DOI":"10.1109\/SPAWC51858.2021.9593182"},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Moldoveanu, M., and Zaidi, A. (2021, January 7\u201311). In-network learning for distributed training and inference in networks. Proceedings of the 2021 IEEE Globecom Workshops (GC Wkshps\u20192021), Madrid, Spain.","DOI":"10.1109\/GCWkshps52748.2021.9682062"},{"key":"ref_57","unstructured":"Zhang, J.A., and Kurkoski, B.M. (November, January 30). Low-complexity quantization of discrete memoryless channels. Proceedings of the 2016 International Symposium on Information Theory and Its Applications (ISITA), Monterey, CA, USA."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Hassanpour, S., W\u00fcbben, D., and Dekorsy, A. (2018, January 15\u201318). On the equivalence of double maxima and KL-means for information bottleneck-based source coding. Proceedings of the 2018 IEEE Wireless Communications and Networking Conference (WCNC), Barcelona, Spain.","DOI":"10.1109\/WCNC.2018.8377199"},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley. [2nd ed.].","DOI":"10.1002\/047174882X"},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., Stark, M., and Bauch, G. (2018, January 25\u201329). A discrete information bottleneck receiver with iterative decision feedback channel estimation. Proceedings of the 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing (ISTC\u20192018), Hong Kong, China.","DOI":"10.1109\/ISTC.2018.8625342"},{"key":"ref_61","unstructured":"Lewandowsky, J. (2020). The Information Bottleneck Method in Communications. [Ph.D. Thesis, Hamburg University of Technology]."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1080\/10618600.1992.10477010","article-title":"Numerical computation of multivariate normal probabilities","volume":"1","author":"Genz","year":"1992","journal-title":"J. Comput. Graph. Stat."},{"key":"ref_63","unstructured":"MacKay, D.J.C. (2017, November 14). Encyclopedia of Sparse Graph Codes. Available online: http:\/\/www.inference.phy.cam.ac.uk\/mackay\/codes\/data.html."},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., Dongare, S.J., Adrat, M., Schrammen, M., and Jax, P. (2020, January 14\u201316). Optimizing parametrized information bottleneck compression mappings with genetic algorithms. Proceedings of the 2020 14th International Conference on Signal Processing and Communication Systems (ICSPCS\u20192020), Adelaide, Australia.","DOI":"10.1109\/ICSPCS50536.2020.9310016"},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., Dongare, S.J., Mart\u00edn Lima, R., Adrat, M., Schrammen, M., and Jax, P. (2021). Genetic Algorithms to Maximize the Relevant Mutual Information in Communication Receivers. Electronics, 10.","DOI":"10.3390\/electronics10121434"},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Coley, D.A. (1998). An Introduction to Genetic Algorithms for Scientists and Engineers, World Scientific Publishing Co., Inc.","DOI":"10.1142\/3904"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/7\/972\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:50:09Z","timestamp":1760140209000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/7\/972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,14]]},"references-count":66,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["e24070972"],"URL":"https:\/\/doi.org\/10.3390\/e24070972","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,14]]}}}