Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 102068
- Type
- D - Journal article
- DOI
-
10.1109/TIT.2016.2544344
- Title of journal
- IEEE Transactions on Information Theory
- Article number
- -
- First page
- 2504
- Volume
- 62
- Issue
- 5
- ISSN
- 00189448
- Open access status
- Out of scope for open access requirements
- Month of publication
- -
- Year of publication
- 2016
- URL
-
https://doi.org/10.1109/TIT.2016.2544344
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
B - Algorithms and Complexity
- Citation count
- 14
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper introduces an approach used in dynamical systems and systems biology (system reduction) to a coding-theoretic problem (network coding solvability). Using this novel approach, we are able to give classification results on the performance of linear network coding.
The network coding solvability problem is an important problem in coding theory, with ramifications to other domains of mathematics and computer science. It is very difficult to come up with general classification results, and our paper actually provides one of those.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -