{"type": "FeatureCollection", "features": [{"id": "1808.10328", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:25:14Z", "type": "Journal Article", "created": "2018-09-05", "title": "Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems", "description": "Open AccessTo appear in IEEE Communications Letters", "keywords": ["FOS: Computer and information sciences", "Discrete Mathematics (cs.DM)", "Computer Science - Information Theory", "Information Theory (cs.IT)", "0202 electrical engineering", " electronic engineering", " information engineering", "0102 computer and information sciences", "02 engineering and technology", "94B20", " 94B25", " 94B50", " 94B65", " 68P20", " 68P30", " 68R05", "01 natural sciences", "Computer Science - Discrete Mathematics"]}, "links": [{"href": "https://doi.org/1808.10328"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Communications%20Letters", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "1808.10328", "name": "item", "description": "1808.10328", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/1808.10328"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2018-11-01T00:00:00Z"}}, {"id": "10.1109/isit.2019.8849847", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:18:36Z", "type": "Journal Article", "created": "2019-09-26", "title": "Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement", "description": "Open AccessTandem-duplication-random-loss (TDRL) is an important genome rearrangement operation studied in evolutionary biology. This paper investigates some of the formal properties of TDRL operations on the symmetric group (the space of permutations over an $ n $-set). In particular, the cardinality of `balls' of radius one in the TDRL metric, as well as the cardinality of the maximum intersection of two such balls, are determined. The corresponding problems for the so-called mirror (or palindromic) TDRL rearrangement operations are also solved. The results represent an initial step in the study of error correction and reconstruction problems in this context and are of potential interest in DNA-based data storage applications.", "keywords": ["genome rearrangement", "sequence reconstruction", "Genomics (q-bio.GN)", "FOS: Computer and information sciences", "Discrete Mathematics (cs.DM)", "DNA storage", "Computer Science - Information Theory", "Information Theory (cs.IT)", "0102 computer and information sciences", "02 engineering and technology", "permutation", "Quantitative Biology - Quantitative Methods", "01 natural sciences", "05A05", " 68R05", " 92B99", " 92D20", " 94B25", "error-correcting code", "FOS: Biological sciences", "0202 electrical engineering", " electronic engineering", " information engineering", "Tandem-duplication-random-loss", "Quantitative Biology - Genomics", "Quantitative Methods (q-bio.QM)", "Computer Science - Discrete Mathematics"], "contacts": [{"organization": "Kova\u010devi\u0107, Mladen, Brdar, Sanja, Crnojevi\u0107, Vladimir,", "roles": ["creator"]}]}, "links": [{"href": "https://doi.org/10.1109/isit.2019.8849847"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/2019%20IEEE%20International%20Symposium%20on%20Information%20Theory%20%28ISIT%29", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "10.1109/isit.2019.8849847", "name": "item", "description": "10.1109/isit.2019.8849847", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/10.1109/isit.2019.8849847"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-07-01T00:00:00Z"}}, {"id": "10.1109/lcomm.2018.2868666", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:18:36Z", "type": "Journal Article", "created": "2018-09-05", "title": "Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems", "description": "Open AccessTo appear in IEEE Communications Letters", "keywords": ["FOS: Computer and information sciences", "Discrete Mathematics (cs.DM)", "bounds on codes", "DNA storage", "Computer Science - Information Theory", "Information Theory (cs.IT)", "synchronization error", "repetition error", "sticky insertion", "0102 computer and information sciences", "02 engineering and technology", "01 natural sciences", "tandem duplication", "0202 electrical engineering", " electronic engineering", " information engineering", "94B20", " 94B25", " 94B50", " 94B65", " 68P20", " 68P30", " 68R05", "Computer Science - Discrete Mathematics"]}, "links": [{"href": "https://doi.org/10.1109/lcomm.2018.2868666"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Communications%20Letters", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "10.1109/lcomm.2018.2868666", "name": "item", "description": "10.1109/lcomm.2018.2868666", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/10.1109/lcomm.2018.2868666"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2018-11-01T00:00:00Z"}}, {"id": "10.1109/tcomm.2019.2894158", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:18:37Z", "type": "Journal Article", "created": "2019-01-22", "title": "Fundamental Limits of Communication Over State-Dependent Channels With Feedback", "description": "Open AccessThe fundamental limits of communication over state-dependent discrete memoryless channels with noiseless feedback are studied, under the assumption that the communicating parties are allowed to use variable-length coding schemes. Various cases are analyzed, with the employed coding schemes having either bounded or unbounded codeword lengths, and with state information revealed to the encoder and/or decoder in a strictly causal, causal, or non-causal manner. In each of these settings, necessary and sufficient conditions for positivity of the zero-error capacity are obtained and it is shown that, whenever the zero-error capacity is positive, it equals the conventional vanishing-error capacity. Moreover, it is shown that the vanishing-error capacity of state-dependent channels is not increased by the use of feedback and variable-length coding. Both these kinds of capacities of state-dependent channels with feedback are thus fully characterized.", "keywords": ["FOS: Computer and information sciences", "zero-error capacity", "Computer Science - Information Theory", "Information Theory (cs.IT)", "variable-length code", "channel capacity", "05 social sciences", "feedback", "02 engineering and technology", "94A24", " 94A45", " 68P30", "0508 media and communications", "0202 electrical engineering", " electronic engineering", " information engineering", "Gelfand\u2013Pinsker", "Channel with states"]}, "links": [{"href": "http://xplorestaging.ieee.org/ielx7/26/8715692/08621013.pdf?arnumber=8621013"}, {"href": "https://doi.org/10.1109/tcomm.2019.2894158"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Transactions%20on%20Communications", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "10.1109/tcomm.2019.2894158", "name": "item", "description": "10.1109/tcomm.2019.2894158", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/10.1109/tcomm.2019.2894158"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-05-01T00:00:00Z"}}, {"id": "10.1109/tit.2019.2907979", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:18:37Z", "type": "Journal Article", "created": "2019-03-28", "title": "Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis", "description": "Open AccessThis work is motivated by the problem of error correction in bit-shift channels with the so-called $ (d,k) $ input constraints (where successive $ 1 $'s are required to be separated by at least $ d $ and at most $ k $ zeros, $ 0  leq d &lt; k  leq  infty $). Bounds on the size of optimal $ (d,k) $-constrained codes correcting a fixed number of bit-shifts are derived, with a focus on their asymptotic behavior in the large block-length limit. The upper bound is obtained by a packing argument, while the lower bound follows from a construction based on a family of integer lattices. Several properties of $ (d, k) $-constrained sequences that may be of independent interest are established as well; in particular, the exponential growth-rate of the number of $ (d, k) $-constrained constant-weight sequences is characterized. The results are relevant for magnetic and optical information storage systems, reader-to-tag RFID channels, and other communication models where bit-shift errors are dominant and where $ (d, k) $-constrained sequences are used for modulation.", "keywords": ["peak shift", "FOS: Computer and information sciences", "bit-shift channel", "asymmetric distance", "timing error", "Discrete Mathematics (cs.DM)", "constant-weight code", "Computer Science - Information Theory", "Information Theory (cs.IT)", "0102 computer and information sciences", "02 engineering and technology", "Manhattan metric", "01 natural sciences", "94B25", " 94B50", " 94B65", " 94A55", "runlength-limited sequence", "constrained code", "0202 electrical engineering", " electronic engineering", " information engineering", "Computer Science - Discrete Mathematics"], "contacts": [{"organization": "Kova\u010devi\u0107, Mladen", "roles": ["creator"]}]}, "links": [{"href": "http://xplorestaging.ieee.org/ielx7/18/8760492/08675954.pdf?arnumber=8675954"}, {"href": "https://doi.org/10.1109/tit.2019.2907979"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Transactions%20on%20Information%20Theory", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "10.1109/tit.2019.2907979", "name": "item", "description": "10.1109/tit.2019.2907979", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/10.1109/tit.2019.2907979"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-08-01T00:00:00Z"}}, {"id": "10.3929/ethz-b-000278733", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:21:19Z", "type": "Journal Article", "created": "2018-07-06", "title": "Cost\u2013benefit optimization of structural health monitoring sensor networks", "description": "<p>Structural health monitoring (SHM) allows the acquisition of information on the structural integrity of any mechanical system by processing data, measured through a set of sensors, in order to estimate relevant mechanical parameters and indicators of performance. Herein we present a method to perform the cost\uffe2\uff80\uff93benefit optimization of a sensor network by defining the density, type, and positioning of the sensors to be deployed. The effectiveness (benefit) of an SHM system may be quantified by means of information theory, namely through the expected Shannon information gain provided by the measured data, which allows the inherent uncertainties of the experimental process (i.e., those associated with the prediction error and the parameters to be estimated) to be accounted for. In order to evaluate the computationally expensive Monte Carlo estimator of the objective function, a framework comprising surrogate models (polynomial chaos expansion), model order reduction methods (principal component analysis), and stochastic optimization methods is introduced. Two optimization strategies are proposed: the maximization of the information provided by the measured data, given the technological, identifiability, and budgetary constraints; and the maximization of the information\uffe2\uff80\uff93cost ratio. The application of the framework to a large-scale structural problem, the Pirelli tower in Milan, is presented, and the two comprehensive optimization methods are compared.</p>", "keywords": ["Stochastic Processes", "structural health monitoring", "structural health monitoring; Bayesian inference; cost\u2013benefit analysis; stochastic optimization; information theory; Bayesian experimental design; surrogate modeling; model order reduction", "Chemical technology", "Cost-Benefit Analysis", "Bayesian inference", "Bayesian experimental design", "Uncertainty", "Bayes Theorem", "TP1-1185", "02 engineering and technology", "stochastic optimization", "Bayesian experimental design; Bayesian inference; Benefit analysis; Cost; Information theory; Model order reduction; Stochastic optimization; Structural health monitoring; Surrogate modeling; Algorithms; Monte Carlo Method; Nonlinear Dynamics; Stochastic Processes; Uncertainty; Bayes Theorem; Cost-Benefit Analysis; Analytical Chemistry; Atomic and Molecular Physics", " and Optics; Biochemistry; Instrumentation; Electrical and Electronic Engineering", "Article", "surrogate modeling", "0201 civil engineering", "Nonlinear Dynamics", "model order reduction", "cost\u2013benefit analysis", "Monte Carlo Method", "Algorithms", "information theory"]}, "links": [{"href": "http://www.mdpi.com/1424-8220/18/7/2174/pdf"}, {"href": "https://re.public.polimi.it/bitstream/11311/1085132/1/Sensors_2018b.pdf"}, {"href": "https://doi.org/10.3929/ethz-b-000278733"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/Sensors", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "10.3929/ethz-b-000278733", "name": "item", "description": "10.3929/ethz-b-000278733", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/10.3929/ethz-b-000278733"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2018-07-06T00:00:00Z"}}, {"id": "10.48550/arxiv.1808.10328", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:21:27Z", "type": "Journal Article", "created": "2018-09-05", "title": "Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems", "description": "Open AccessTo appear in IEEE Communications Letters", "keywords": ["FOS: Computer and information sciences", "Discrete Mathematics (cs.DM)", "bounds on codes", "DNA storage", "Computer Science - Information Theory", "Information Theory (cs.IT)", "synchronization error", "repetition error", "sticky insertion", "0102 computer and information sciences", "02 engineering and technology", "01 natural sciences", "tandem duplication", "0202 electrical engineering", " electronic engineering", " information engineering", "94B20", " 94B25", " 94B50", " 94B65", " 68P20", " 68P30", " 68R05", "Computer Science - Discrete Mathematics"]}, "links": [{"href": "https://doi.org/10.48550/arxiv.1808.10328"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Communications%20Letters", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "10.48550/arxiv.1808.10328", "name": "item", "description": "10.48550/arxiv.1808.10328", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/10.48550/arxiv.1808.10328"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2018-11-01T00:00:00Z"}}, {"id": "10.48550/arxiv.1902.00230", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:21:27Z", "type": "Journal Article", "created": "2019-09-26", "title": "Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement", "description": "Open AccessTandem-duplication-random-loss (TDRL) is an important genome rearrangement operation studied in evolutionary biology. This paper investigates some of the formal properties of TDRL operations on the symmetric group (the space of permutations over an $ n $-set). In particular, the cardinality of `balls' of radius one in the TDRL metric, as well as the cardinality of the maximum intersection of two such balls, are determined. The corresponding problems for the so-called mirror (or palindromic) TDRL rearrangement operations are also solved. The results represent an initial step in the study of error correction and reconstruction problems in this context and are of potential interest in DNA-based data storage applications.", "keywords": ["genome rearrangement", "sequence reconstruction", "Genomics (q-bio.GN)", "FOS: Computer and information sciences", "Discrete Mathematics (cs.DM)", "DNA storage", "Computer Science - Information Theory", "Information Theory (cs.IT)", "0102 computer and information sciences", "02 engineering and technology", "permutation", "Quantitative Biology - Quantitative Methods", "01 natural sciences", "05A05", " 68R05", " 92B99", " 92D20", " 94B25", "error-correcting code", "FOS: Biological sciences", "0202 electrical engineering", " electronic engineering", " information engineering", "Tandem-duplication-random-loss", "Quantitative Biology - Genomics", "Quantitative Methods (q-bio.QM)", "Computer Science - Discrete Mathematics"], "contacts": [{"organization": "Kova\u010devi\u0107, Mladen, Brdar, Sanja, Crnojevi\u0107, Vladimir,", "roles": ["creator"]}]}, "links": [{"href": "https://doi.org/10.48550/arxiv.1902.00230"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/2019%20IEEE%20International%20Symposium%20on%20Information%20Theory%20%28ISIT%29", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "10.48550/arxiv.1902.00230", "name": "item", "description": "10.48550/arxiv.1902.00230", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/10.48550/arxiv.1902.00230"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-07-01T00:00:00Z"}}, {"id": "2888898008", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:25:58Z", "type": "Journal Article", "created": "2018-09-05", "title": "Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems", "description": "Open AccessTo appear in IEEE Communications Letters", "keywords": ["FOS: Computer and information sciences", "Discrete Mathematics (cs.DM)", "bounds on codes", "DNA storage", "Computer Science - Information Theory", "Information Theory (cs.IT)", "synchronization error", "repetition error", "sticky insertion", "0102 computer and information sciences", "02 engineering and technology", "01 natural sciences", "tandem duplication", "0202 electrical engineering", " electronic engineering", " information engineering", "94B20", " 94B25", " 94B50", " 94B65", " 68P20", " 68P30", " 68R05", "Computer Science - Discrete Mathematics"]}, "links": [{"href": "https://doi.org/2888898008"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Communications%20Letters", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "2888898008", "name": "item", "description": "2888898008", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/2888898008"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2018-11-01T00:00:00Z"}}, {"id": "1902.06275", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:25:19Z", "type": "Journal Article", "created": "2019-07-25", "title": "Zero-Error Capacity of Duplication Channels", "description": "Open Access8 pages (double-column), 4 figures. Accepted for publication in IEEE Transactions on Communications", "keywords": ["FOS: Computer and information sciences", "94A24", " 94B25", " 94B50", " 68P30", " 68R05", "0508 media and communications", "Discrete Mathematics (cs.DM)", "Computer Science - Information Theory", "Information Theory (cs.IT)", "05 social sciences", "0202 electrical engineering", " electronic engineering", " information engineering", "02 engineering and technology", "Computer Science - Discrete Mathematics"], "contacts": [{"organization": "Mladen Kovacevic", "roles": ["creator"]}]}, "links": [{"href": "https://doi.org/1902.06275"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Transactions%20on%20Communications", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "1902.06275", "name": "item", "description": "1902.06275", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/1902.06275"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-10-01T00:00:00Z"}}, {"id": "2910479425", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:26:01Z", "type": "Journal Article", "created": "2019-01-22", "title": "Fundamental Limits of Communication Over State-Dependent Channels With Feedback", "description": "Open AccessThe fundamental limits of communication over state-dependent discrete memoryless channels with noiseless feedback are studied, under the assumption that the communicating parties are allowed to use variable-length coding schemes. Various cases are analyzed, with the employed coding schemes having either bounded or unbounded codeword lengths, and with state information revealed to the encoder and/or decoder in a strictly causal, causal, or non-causal manner. In each of these settings, necessary and sufficient conditions for positivity of the zero-error capacity are obtained and it is shown that, whenever the zero-error capacity is positive, it equals the conventional vanishing-error capacity. Moreover, it is shown that the vanishing-error capacity of state-dependent channels is not increased by the use of feedback and variable-length coding. Both these kinds of capacities of state-dependent channels with feedback are thus fully characterized.", "keywords": ["FOS: Computer and information sciences", "zero-error capacity", "Computer Science - Information Theory", "Information Theory (cs.IT)", "variable-length code", "channel capacity", "05 social sciences", "feedback", "02 engineering and technology", "94A24", " 94A45", " 68P30", "0508 media and communications", "0202 electrical engineering", " electronic engineering", " information engineering", "Gelfand\u2013Pinsker", "Channel with states"]}, "links": [{"href": "http://xplorestaging.ieee.org/ielx7/26/8715692/08621013.pdf?arnumber=8621013"}, {"href": "https://doi.org/2910479425"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Transactions%20on%20Communications", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "2910479425", "name": "item", "description": "2910479425", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/2910479425"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-05-01T00:00:00Z"}}, {"id": "1712.07756", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:25:12Z", "type": "Journal Article", "created": "2019-01-22", "title": "Fundamental Limits of Communication Over State-Dependent Channels With Feedback", "description": "Open AccessThe fundamental limits of communication over state-dependent discrete memoryless channels with noiseless feedback are studied, under the assumption that the communicating parties are allowed to use variable-length coding schemes. Various cases are analyzed, with the employed coding schemes having either bounded or unbounded codeword lengths, and with state information revealed to the encoder and/or decoder in a strictly causal, causal, or non-causal manner. In each of these settings, necessary and sufficient conditions for positivity of the zero-error capacity are obtained and it is shown that, whenever the zero-error capacity is positive, it equals the conventional vanishing-error capacity. Moreover, it is shown that the vanishing-error capacity of state-dependent channels is not increased by the use of feedback and variable-length coding. Both these kinds of capacities of state-dependent channels with feedback are thus fully characterized.", "keywords": ["FOS: Computer and information sciences", "0508 media and communications", "Computer Science - Information Theory", "Information Theory (cs.IT)", "05 social sciences", "0202 electrical engineering", " electronic engineering", " information engineering", "02 engineering and technology", "94A24", " 94A45", " 68P30"]}, "links": [{"href": "http://xplorestaging.ieee.org/ielx7/26/8715692/08621013.pdf?arnumber=8621013"}, {"href": "https://doi.org/1712.07756"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Transactions%20on%20Communications", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "1712.07756", "name": "item", "description": "1712.07756", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/1712.07756"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-05-01T00:00:00Z"}}, {"id": "1803.06117", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:25:13Z", "type": "Journal Article", "created": "2019-03-28", "title": "Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis", "description": "Open AccessThis work is motivated by the problem of error correction in bit-shift channels with the so-called $ (d,k) $ input constraints (where successive $ 1 $'s are required to be separated by at least $ d $ and at most $ k $ zeros, $ 0  leq d &lt; k  leq  infty $). Bounds on the size of optimal $ (d,k) $-constrained codes correcting a fixed number of bit-shifts are derived, with a focus on their asymptotic behavior in the large block-length limit. The upper bound is obtained by a packing argument, while the lower bound follows from a construction based on a family of integer lattices. Several properties of $ (d, k) $-constrained sequences that may be of independent interest are established as well; in particular, the exponential growth-rate of the number of $ (d, k) $-constrained constant-weight sequences is characterized. The results are relevant for magnetic and optical information storage systems, reader-to-tag RFID channels, and other communication models where bit-shift errors are dominant and where $ (d, k) $-constrained sequences are used for modulation.", "keywords": ["FOS: Computer and information sciences", "94B25", " 94B50", " 94B65", " 94A55", "Discrete Mathematics (cs.DM)", "Computer Science - Information Theory", "Information Theory (cs.IT)", "0202 electrical engineering", " electronic engineering", " information engineering", "0102 computer and information sciences", "02 engineering and technology", "01 natural sciences", "Computer Science - Discrete Mathematics"], "contacts": [{"organization": "Mladen Kovacevic", "roles": ["creator"]}]}, "links": [{"href": "http://xplorestaging.ieee.org/ielx7/18/8760492/08675954.pdf?arnumber=8675954"}, {"href": "https://doi.org/1803.06117"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Transactions%20on%20Information%20Theory", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "1803.06117", "name": "item", "description": "1803.06117", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/1803.06117"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-08-01T00:00:00Z"}}, {"id": "2914412789", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:26:01Z", "type": "Journal Article", "created": "2019-07-25", "title": "Zero-Error Capacity of Duplication Channels", "description": "Open Access8 pages (double-column), 4 figures. Accepted for publication in IEEE Transactions on Communications", "keywords": ["FOS: Computer and information sciences", "94A24", " 94B25", " 94B50", " 68P30", " 68R05", "Discrete Mathematics (cs.DM)", "DNA storage", "Computer Science - Information Theory", "Information Theory (cs.IT)", "Synchronization error", "05 social sciences", "repetition error", "sticky insertion", "duplication error", "02 engineering and technology", "0508 media and communications", "tandem duplication", "0202 electrical engineering", " electronic engineering", " information engineering", "reliable communication", "zero-error code", "Computer Science - Discrete Mathematics"], "contacts": [{"organization": "Kova\u010devi\u0107, Mladen", "roles": ["creator"]}]}, "links": [{"href": "https://doi.org/2914412789"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Transactions%20on%20Communications", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "2914412789", "name": "item", "description": "2914412789", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/2914412789"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-10-01T00:00:00Z"}}, {"id": "1902.0023", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:25:19Z", "type": "Journal Article", "created": "2019-09-26", "title": "Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement", "description": "Open AccessTandem-duplication-random-loss (TDRL) is an important genome rearrangement operation studied in evolutionary biology. This paper investigates some of the formal properties of TDRL operations on the symmetric group (the space of permutations over an $ n $-set). In particular, the cardinality of `balls' of radius one in the TDRL metric, as well as the cardinality of the maximum intersection of two such balls, are determined. The corresponding problems for the so-called mirror (or palindromic) TDRL rearrangement operations are also solved. The results represent an initial step in the study of error correction and reconstruction problems in this context and are of potential interest in DNA-based data storage applications.", "keywords": ["Genomics (q-bio.GN)", "FOS: Computer and information sciences", "Discrete Mathematics (cs.DM)", "Computer Science - Information Theory", "Information Theory (cs.IT)", "0102 computer and information sciences", "02 engineering and technology", "Quantitative Biology - Quantitative Methods", "01 natural sciences", "05A05", " 68R05", " 92B99", " 92D20", " 94B25", "FOS: Biological sciences", "0202 electrical engineering", " electronic engineering", " information engineering", "Quantitative Biology - Genomics", "Quantitative Methods (q-bio.QM)", "Computer Science - Discrete Mathematics"]}, "links": [{"href": "https://doi.org/1902.0023"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/2019%20IEEE%20International%20Symposium%20on%20Information%20Theory%20%28ISIT%29", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "1902.0023", "name": "item", "description": "1902.0023", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/1902.0023"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-07-01T00:00:00Z"}}, {"id": "3102056862", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:26:17Z", "type": "Journal Article", "created": "2019-09-26", "title": "Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement", "description": "Open AccessTandem-duplication-random-loss (TDRL) is an important genome rearrangement operation studied in evolutionary biology. This paper investigates some of the formal properties of TDRL operations on the symmetric group (the space of permutations over an $ n $-set). In particular, the cardinality of `balls' of radius one in the TDRL metric, as well as the cardinality of the maximum intersection of two such balls, are determined. The corresponding problems for the so-called mirror (or palindromic) TDRL rearrangement operations are also solved. The results represent an initial step in the study of error correction and reconstruction problems in this context and are of potential interest in DNA-based data storage applications.", "keywords": ["genome rearrangement", "sequence reconstruction", "Genomics (q-bio.GN)", "FOS: Computer and information sciences", "Discrete Mathematics (cs.DM)", "DNA storage", "Computer Science - Information Theory", "Information Theory (cs.IT)", "0102 computer and information sciences", "02 engineering and technology", "permutation", "Quantitative Biology - Quantitative Methods", "01 natural sciences", "05A05", " 68R05", " 92B99", " 92D20", " 94B25", "error-correcting code", "FOS: Biological sciences", "0202 electrical engineering", " electronic engineering", " information engineering", "Tandem-duplication-random-loss", "Quantitative Biology - Genomics", "Quantitative Methods (q-bio.QM)", "Computer Science - Discrete Mathematics"], "contacts": [{"organization": "Kova\u010devi\u0107, Mladen, Brdar, Sanja, Crnojevi\u0107, Vladimir,", "roles": ["creator"]}]}, "links": [{"href": "https://doi.org/3102056862"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/2019%20IEEE%20International%20Symposium%20on%20Information%20Theory%20%28ISIT%29", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "3102056862", "name": "item", "description": "3102056862", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/3102056862"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-07-01T00:00:00Z"}}, {"id": "2164/19434", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:25:42Z", "type": "Journal Article", "created": "2022-08-22", "title": "Global systematic review with meta-analysis reveals yield advantage of legume-based rotations and its drivers", "description": "Abstract<p>Diversified cropping systems, especially those including legumes, have been proposed to enhance food production with reduced inputs and environmental impacts. However, the impact of legume pre-crops on main crop yield and its drivers has never been systematically investigated in a global context. Here, we synthesize 11,768 yield observations from 462 field experiments comparing legume-based and non-legume cropping systems and show that legumes enhanced main crop yield by 20%. These yield advantages decline with increasing N fertilizer rates and crop diversity of the main cropping system. The yield benefits are consistent among main crops (e.g., rice, wheat, maize) and evident across pedo-climatic regions. Moreover, greater yield advantages (32% vs. 7%) are observed in low- vs. high-yielding environments, suggesting legumes increase crop production with low inputs (e.g., in Africa or organic agriculture). In conclusion, our study suggests that legume-based rotations offer a critical pathway for enhancing global crop production, especially when integrated into low-input and low-diversity agricultural systems.</p", "keywords": ["0106 biological sciences", "QH301 Biology", "F08 - Syst\u00e8mes et modes de culture", "rendement des cultures", "General Physics and Astronomy", "01 natural sciences", "fertilisation", "Crop rotation", "[SHS.STAT] Humanities and Social Sciences/Methods and statistics", "Vegetables", "m\u00e9thode statistique", "article de revue", "http://aims.fao.org/aos/agrovoc/c_05ceb781", "http://aims.fao.org/aos/agrovoc/c_3862", "http://aims.fao.org/aos/agrovoc/c_4871", "http://aims.fao.org/aos/agrovoc/c_10795", "2. Zero hunger", "[INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI]", "Q", "Agriculture", "Fabaceae", "04 agricultural and veterinary sciences", "Crop Production", "https://doi.org/10.1038/s41467-022-32464-0", "C30 - Documentation et information", "[INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT]", "[INFO.INFO-DL] Computer Science [cs]/Digital Libraries [cs.DL]", "http://aims.fao.org/aos/agrovoc/c_7377", "http://aims.fao.org/aos/agrovoc/c_10289", "Crops", " Agricultural", "Yield", "Supplementary Information", "330", "Science", "General Biochemistry", "Genetics and Molecular Biology", "traitement des donn\u00e9es", "[SDV.SA.STA] Life Sciences [q-bio]/Agricultural sciences/Sciences and technics of agriculture", "Crops", "[SHS.INFO] Humanities and Social Sciences/Library and information sciences", "Article", "QH301", "[SDV.SA.HORT] Life Sciences [q-bio]/Agricultural sciences/Horticulture", "http://aims.fao.org/aos/agrovoc/c_10176", "http://aims.fao.org/aos/agrovoc/c_8174", "SDG 2 - Zero Hunger", "General", "traitement de l'information", "Fertilizers", "Fertilizers/analysis", "Agricultural", "General Chemistry", "l\u00e9gume", "15. Life on land", "Meta-analysis", "culture en m\u00e9lange", "http://aims.fao.org/aos/agrovoc/c_3910", "0401 agriculture", " forestry", " and fisheries", "[INFO.INFO-IR] Computer Science [cs]/Information Retrieval [cs.IR]", "culture intercalaire", "U30 - M\u00e9thodes de recherche"]}, "links": [{"href": "https://doi.org/2164/19434"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/Nature%20Communications", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "2164/19434", "name": "item", "description": "2164/19434", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/2164/19434"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2022-08-22T00:00:00Z"}}, {"id": "3098301730", "type": "Feature", "geometry": null, "properties": {"updated": "2026-07-25T16:26:16Z", "type": "Journal Article", "created": "2019-03-28", "title": "Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis", "description": "Open AccessThis work is motivated by the problem of error correction in bit-shift channels with the so-called $ (d,k) $ input constraints (where successive $ 1 $'s are required to be separated by at least $ d $ and at most $ k $ zeros, $ 0  leq d &lt; k  leq  infty $). Bounds on the size of optimal $ (d,k) $-constrained codes correcting a fixed number of bit-shifts are derived, with a focus on their asymptotic behavior in the large block-length limit. The upper bound is obtained by a packing argument, while the lower bound follows from a construction based on a family of integer lattices. Several properties of $ (d, k) $-constrained sequences that may be of independent interest are established as well; in particular, the exponential growth-rate of the number of $ (d, k) $-constrained constant-weight sequences is characterized. The results are relevant for magnetic and optical information storage systems, reader-to-tag RFID channels, and other communication models where bit-shift errors are dominant and where $ (d, k) $-constrained sequences are used for modulation.", "keywords": ["peak shift", "FOS: Computer and information sciences", "bit-shift channel", "asymmetric distance", "timing error", "Discrete Mathematics (cs.DM)", "constant-weight code", "Computer Science - Information Theory", "Information Theory (cs.IT)", "0102 computer and information sciences", "02 engineering and technology", "Manhattan metric", "01 natural sciences", "94B25", " 94B50", " 94B65", " 94A55", "runlength-limited sequence", "constrained code", "0202 electrical engineering", " electronic engineering", " information engineering", "Computer Science - Discrete Mathematics"], "contacts": [{"organization": "Kova\u010devi\u0107, Mladen", "roles": ["creator"]}]}, "links": [{"href": "http://xplorestaging.ieee.org/ielx7/18/8760492/08675954.pdf?arnumber=8675954"}, {"href": "https://doi.org/3098301730"}, {"rel": "related", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/IEEE%20Transactions%20on%20Information%20Theory", "name": "related record", "description": "related record", "type": "application/json"}, {"rel": "self", "type": "application/geo+json", "title": "3098301730", "name": "item", "description": "3098301730", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items/3098301730"}, {"rel": "collection", "type": "application/json", "title": "Collection", "name": "collection", "description": "Collection", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main"}], "time": {"date": "2019-08-01T00:00:00Z"}}], "links": [{"rel": "self", "type": "application/geo+json", "title": "This document as GeoJSON", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items?keywords=information+theory&f=json", "hreflang": "en-US"}, {"rel": "alternate", "type": "text/html", "title": "This document as HTML", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items?keywords=information+theory&f=html", "hreflang": "en-US"}, {"rel": "collection", "type": "application/json", "title": "Collection URL", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main", "hreflang": "en-US"}, {"type": "application/geo+json", "rel": "first", "title": "items (first)", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items?keywords=information+theory&", "hreflang": "en-US"}, {"rel": "last", "type": "application/geo+json", "title": "items (last)", "href": "https://repository.soilwise-he.eu/cat/collections/metadata:main/items?keywords=information+theory&offset=18", "hreflang": "en-US"}], "numberMatched": 18, "numberReturned": 18, "distributedFeatures": [], "timeStamp": "2026-07-26T12:02:38.188781Z"}