{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:26:21Z","timestamp":1760239581022,"version":"build-2065373602"},"reference-count":35,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T00:00:00Z","timestamp":1606867200000},"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>A new class of convolutional codes, called skew convolutional codes, that extends the class of classical fixed convolutional codes, is proposed. Skew convolutional codes can be represented as periodic time-varying convolutional codes but have a description as compact as fixed convolutional codes. Designs of generator and parity check matrices, encoders, and code trellises for skew convolutional codes and their duals are shown. For memoryless channels, one can apply Viterbi or BCJR decoding algorithms, or a dualized BCJR algorithm, to decode skew convolutional codes.<\/jats:p>","DOI":"10.3390\/e22121364","type":"journal-article","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T20:25:49Z","timestamp":1606940749000},"page":"1364","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Skew Convolutional Codes"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4966-3684","authenticated-orcid":false,"given":"Vladimir","family":"Sidorenko","sequence":"first","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich, 80333 M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenhui","family":"Li","sequence":"additional","affiliation":[{"name":"Skolkovo Institute of Science and Technology, 143026 Moscow, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0313-7788","authenticated-orcid":false,"given":"Onur","family":"G\u00fcnl\u00fc","sequence":"additional","affiliation":[{"name":"Information Theory and Applications Chair, Technical University of Berlin, 10623 Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3904-9181","authenticated-orcid":false,"given":"Gerhard","family":"Kramer","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich, 80333 M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,12,2]]},"reference":[{"key":"ref_1","first-page":"37","article-title":"Coding for noisy channels","volume":"4","author":"Elias","year":"1955","journal-title":"IRE Conv. Rec."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TIT.1963.1057827","article-title":"A heuristic discussion of probabilistic decoding","volume":"9","author":"Fano","year":"1963","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Massey, J.L. (1963). Threshold Decoding, MIT Press.","key":"ref_3","DOI":"10.21236\/AD0407946"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","article-title":"Error bounds for convolutional codes and an asymptotically optimum decoding algorithm","volume":"13","author":"Viterbi","year":"1967","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Berrou, C., Glavieux, A., and Thitimajshima, P. (1993, January 23\u201326). Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1. Proceedings of the ICC \u201993\u2014IEEE International Conference on Communications, Geneva, Switzerland.","key":"ref_5"},{"unstructured":"(2020, December 01). IEEE Standard for Telecommunications and Information Exchange between Systems-LAN\/MAN Specific Requirements \u2014Part 11: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications: High Speed Physical Layer in the 5 GHz Band. Available online: https:\/\/ieeexplore.ieee.org\/document\/815305.","key":"ref_6"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1109\/TIFS.2011.2134094","article-title":"Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes","volume":"6","author":"Filler","year":"2011","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/JCN.2014.000047","article-title":"Nonbinary convolutional codes and modified M-FSK detectors for power-line communications channel","volume":"16","author":"Ouahada","year":"2014","journal-title":"J. Commun. Netw."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2417","DOI":"10.1109\/TIT.2019.2963872","article-title":"Private Streaming With Convolutional Codes","volume":"66","author":"Holzbaur","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/TIT.1983.1056727","article-title":"Some periodic convolutional codes better than any fixed code (Corresp.)","volume":"29","author":"Mooser","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1109\/18.32142","article-title":"There are many good periodically time-varying convolutional codes","volume":"35","author":"Lee","year":"1989","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","first-page":"1","article-title":"Theory of Codes with Maximum Rank Distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Probl. Inform. Trans."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1016\/j.jsc.2007.11.008","article-title":"Coding with skew polynomial rings","volume":"44","author":"Boucher","year":"2009","journal-title":"J. Symb. Comput."},{"doi-asserted-by":"crossref","unstructured":"Boucher, D., and Ulmer, F. (2009). Codes as Modules over Skew Polynomial Rings, Springer.","key":"ref_14","DOI":"10.1007\/978-3-642-10868-6_3"},{"doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Pe\u00f1as, U. (2020). Sum-Rank BCH Codes and Cyclic-Skew-Cyclic Codes. arXiv.","key":"ref_15","DOI":"10.1109\/TIT.2021.3088712"},{"unstructured":"Gluesing-Luerssen, H. (2019). Skew-Polynomial Rings and Skew-Cyclic Codes. arXiv.","key":"ref_16"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2081","DOI":"10.1109\/TIT.2010.2044062","article-title":"On the Construction of Skew Quasi-Cyclic Codes","volume":"56","author":"Abualrub","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"480","DOI":"10.2307\/1968173","article-title":"Theory of Non-Commutative Polynomials","volume":"34","author":"Ore","year":"1933","journal-title":"Ann. Math."},{"unstructured":"Clark, P. (2012). Non-Commutative Algebra, University of Georgia.","key":"ref_19"},{"doi-asserted-by":"crossref","unstructured":"Johannesson, R., and Zigangirov, K.S. (2015). Fundamentals of Convolutional Coding, John Wiley and Sons, Ltd.","key":"ref_20","DOI":"10.1002\/9781119098799"},{"key":"ref_21","first-page":"1065","article-title":"The Algebraic Theory of Convolutional Codes","volume":"Volume I","author":"Pless","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1109\/18.21238","article-title":"Finite-state codes","volume":"34","author":"Pollara","year":"1988","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s002000050120","article-title":"Maximum Distance Separable Convolutional Codes","volume":"10","author":"Rosenthal","year":"1998","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"doi-asserted-by":"crossref","unstructured":"Gluesing-Luerssen, H., and Schmale, W. (2003). Distance bounds for convolutional codes and some optimal codes. arXiv.","key":"ref_24","DOI":"10.1023\/B:ACAP.0000027534.61242.09"},{"unstructured":"Jordan, R., Pavlushkov, V., and Zyablov, V.V. (July, January 30). An upper bound on the slope of convolutional codes. Proceedings of the 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland.","key":"ref_25"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3199","DOI":"10.1109\/TIT.2015.2424930","article-title":"Convolutional Codes in Rank Metric with Application to Random Network Coding","volume":"61","author":"Stinner","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1663","DOI":"10.1109\/18.333887","article-title":"Decoding of convolutional codes using a syndrome trellis","volume":"40","author":"Sidorenko","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","article-title":"Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)","volume":"20","author":"Bahl","year":"1974","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Li, W., Sidorenko, V., Jerkovits, T., and Kramer, G. (2019, January 21\u201325). On Maximum-Likelihood Decoding of Time-Varying Trellis Codes. Proceedings of the 2019 XVI International Symposium \u201cProblems of Redundancy in Information and Control Systems\u201d (REDUNDANCY), Moscow, Russia.","key":"ref_29","DOI":"10.1109\/REDUNDANCY48165.2019.9003340"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1109\/18.490504","article-title":"Optimal sectionalization of a trellis","volume":"42","author":"Lafourcade","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TIT.1976.1055617","article-title":"An optimum symbol-by-symbol decoding rule for linear codes","volume":"22","author":"Hartmann","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1743","DOI":"10.1109\/TCOMM.2002.805278","article-title":"On dualizing trellis-based APP decoding algorithms","volume":"50","author":"Berkmann","year":"2002","journal-title":"IEEE Trans. Commun."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1109\/TIT.2009.2034882","article-title":"Decoding of High Rate Convolutional Codes Using the Dual Trellis","volume":"56","author":"Srinivasan","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/18.651076","article-title":"A link between quasi-cyclic codes and convolutional codes","volume":"44","author":"Esmaeili","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_35","first-page":"98","article-title":"Block Codes from Convolution Codes","volume":"25","author":"Kudryashov","year":"1989","journal-title":"Probl. Peredachi Inf."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/12\/1364\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:40:48Z","timestamp":1760179248000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/12\/1364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,2]]},"references-count":35,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2020,12]]}},"alternative-id":["e22121364"],"URL":"https:\/\/doi.org\/10.3390\/e22121364","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2020,12,2]]}}}