Log in

Relevant bibliographies by topics / Self-orthogonal codes

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Self-orthogonal codes'

Author: Grafiati

Published: 4 June 2021

Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Self-orthogonal codes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Self-orthogonal codes"

1

BASSA, Alp, and Nesrin TUTAŞ. "Extending self-orthogonal codes." TURKISH JOURNAL OF MATHEMATICS 43, no. 5 (2019): 2177–82. http://dx.doi.org/10.3906/mat-1905-103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Durğun, Yilmaz. "Extended maximal self-orthogonal codes." Discrete Mathematics, Algorithms and Applications 11, no. 05 (2019): 1950052. http://dx.doi.org/10.1142/s1793830919500526.

Full text

Abstract:

Self-dual and maximal self-orthogonal codes over [Formula: see text], where [Formula: see text] is even or [Formula: see text](mod 4), are extensively studied in this paper. We prove that every maximal self-orthogonal code can be extended to a self-dual code as in the case of binary Golay code. Using these results, we show that a self-dual code can also be constructed by gluing theory even if the sum of the lengths of the gluing components is odd. Furthermore, the (Hamming) weight enumerator [Formula: see text] of a self-dual code [Formula: see text] is given in terms of a maximal self-orthogonal code [Formula: see text], where [Formula: see text] is obtained by the extension of [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

3

Wassermann, Alfred, and Axel Kohnert. "Construction of self-orthogonal linear codes." Electronic Notes in Discrete Mathematics 27 (October 2006): 105. http://dx.doi.org/10.1016/j.endm.2006.08.077.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Fang, Xiaolei, Meiqing Liu, and Jinquan Luo. "New MDS Euclidean Self-Orthogonal Codes." IEEE Transactions on Information Theory 67, no. 1 (2021): 130–37. http://dx.doi.org/10.1109/tit.2020.3020986.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Pott, Alexander. "A note on self-orthogonal codes." Discrete Mathematics 76, no. 3 (1989): 283–84. http://dx.doi.org/10.1016/0012-365x(89)90327-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Fu, Wenqing, and Tao Feng. "On self-orthogonal group ring codes." Designs, Codes and Cryptography 50, no. 2 (2008): 203–14. http://dx.doi.org/10.1007/s10623-008-9224-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lisoněk, Petr, and Vijaykumar Singh. "Quantum codes from nearly self-orthogonal quaternary linear codes." Designs, Codes and Cryptography 73, no. 2 (2014): 417–24. http://dx.doi.org/10.1007/s10623-014-9934-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bouyuklieva, Stefka. "Some optimal self-orthogonal and self-dual codes." Discrete Mathematics 287, no. 1-3 (2004): 1–10. http://dx.doi.org/10.1016/j.disc.2004.06.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Guo, Luobin, Yuena Ma, and Youqian Feng. "Quantum Codes Constructed from Self-Dual Codes and Maximal Self-Orthogonal Codes Over F5." Procedia Engineering 29 (2012): 3448–53. http://dx.doi.org/10.1016/j.proeng.2012.01.510.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Singh, Abhay Kumar, Narendra Kumar, and Kar Ping Shum. "Cyclic self-orthogonal codes over finite chain ring." Asian-European Journal of Mathematics 11, no. 06 (2018): 1850078. http://dx.doi.org/10.1142/s179355711850078x.

Full text

Abstract:

In this paper, we study the cyclic self-orthogonal codes over a finite commutative chain ring [Formula: see text], where [Formula: see text] is a prime number. A generating polynomial of cyclic self-orthogonal codes over [Formula: see text] is obtained. We also provide a necessary and sufficient condition for the existence of nontrivial self-orthogonal codes over [Formula: see text]. Finally, we determine the number of the above codes with length [Formula: see text] over [Formula: see text] for any [Formula: see text]. The results are given by Zhe-Xian Wan on cyclic codes over Galois rings in [Z. Wan, Cyclic codes over Galois rings, Algebra Colloq. 6 (1999) 291–304] are extended and strengthened to cyclic self-orthogonal codes over [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Self-orthogonal codes"

1

Pinnawala, Nimalsiri, and nimalsiri pinnawala@rmit edu au. "Properties of Trace Maps and their Applications to Coding Theory." RMIT University. Mathematical and Geospatial Sciences, 2008. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080515.121603.

Full text

Abstract:

In this thesis we study the application of trace maps over Galois fields and Galois rings in the construction of non-binary linear and non-linear codes and mutually unbiased bases. Properties of the trace map over the Galois fields and Galois rings has been used very successfully in the construction of cocyclic Hadamard, complex Hadamard and Butson Hadamard matrices and consequently to construct linear codes over integers modulo prime and prime powers. These results provide motivation to extend this work to construct codes over integers modulo . The prime factorization of integers paved the way to focus our attention on the direct product of Galois rings and Galois fields of the same degree. We define a new map over the direct product of Galois rings and Galois fields by using the usual trace maps. We study the fundamental properties of the this map and notice that these are very similar to that of the trace map over Galois rings and Galois fields. As such this map called the trace-like map and is used to construct cocyclic Butson Hadamard matrices and consequently to construct linear codes over integers modulo . We notice that the codes construct in this way over the integers modulo 6 is simplex code of type . A further generalization of the trace-like map called the weighted-trace map is defined over the direct product of Galois rings and Galois fields of different degrees. We use the weighted-trace map to construct some non-linear codes and mutually unbiased bases of odd integer dimensions. Further more we study the distribution of over the Galois fields of degree 2 and use it to construct 2-dimensional, two-weight, self-orthogonal codes and constant weight codes over integers modulo prime.

APA, Harvard, Vancouver, ISO, and other styles

2

Sarvepalli, Pradeep Kiran. "Quantum stabilizer codes and beyond." Diss., Texas A&M University, 2008. http://hdl.handle.net/1969.1/86011.

Full text

Abstract:

The importance of quantum error correction in paving the way to build a practical quantum computer is no longer in doubt. Despite the large body of literature in quantum coding theory, many important questions, especially those centering on the issue of "good codes" are unresolved. In this dissertation the dominant underlying theme is that of constructing good quantum codes. It approaches this problem from three rather different but not exclusive strategies. Broadly, its contribution to the theory of quantum error correction is threefold. Firstly, it extends the framework of an important class of quantum codes - nonbinary stabilizer codes. It clarifies the connections of stabilizer codes to classical codes over quadratic extension fields, provides many new constructions of quantum codes, and develops further the theory of optimal quantum codes and punctured quantum codes. In particular it provides many explicit constructions of stabilizer codes, most notably it simplifies the criteria by which quantum BCH codes can be constructed from classical codes. Secondly, it contributes to the theory of operator quantum error correcting codes also called as subsystem codes. These codes are expected to have efficient error recovery schemes than stabilizer codes. Prior to our work however, systematic methods to construct these codes were few and it was not clear how to fairly compare them with other classes of quantum codes. This dissertation develops a framework for study and analysis of subsystem codes using character theoretic methods. In particular, this work established a close link between subsystem codes and classical codes and it became clear that the subsystem codes can be constructed from arbitrary classical codes. Thirdly, it seeks to exploit the knowledge of noise to design efficient quantum codes and considers more realistic channels than the commonly studied depolarizing channel. It gives systematic constructions of asymmetric quantum stabilizer codes that exploit the asymmetry of errors in certain quantum channels. This approach is based on a Calderbank- Shor-Steane construction that combines BCH and finite geometry LDPC codes.

APA, Harvard, Vancouver, ISO, and other styles

3

Nasr, Esfahani Navid. "The relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codes." 2014. http://hdl.handle.net/1993/23843.

Full text

Abstract:

Balanced Incomplete Block Designs and Binary Linear Codes are two combinatorial designs. Due to the vast application of codes in communication the field of coding theory progressed more rapidly than many other fields of combinatorial designs. On the other hand, Block Designs are applicable in statistics and designing experiments in different fields, such as biology, medicine, and agriculture. Finding the relationship between instances of these two designs can be useful in constructing instances of one from the other. Applying the properties of codes to corresponding instances of Balanced Incomplete Block Designs has been used previously to show the non-existence of some designs. In this research the relationship between (16,6,3)-designs and (25,12) codes was determined.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Self-orthogonal codes"

1

Monroe, Laura. "Self-Orthogonal Greedy Codes." In Codes, Designs and Geometry. Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1423-3_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wood, Jay A. "Self-Orthogonal Codes and the Topology of Spinor Groups." In Coding Theory and Design Theory. Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4613-8994-1_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kim, Jon-Lark. "New Quantum Error-Correcting Codes from Hermitian Self-Orthogonal Codes over GF(4)." In Finite Fields with Applications to Coding Theory, Cryptography and Related Areas. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-59435-9_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Jiao, Hongying, Jinguo Zhang, and Miaohua Liu. "Some New Hermitian Self-orthogonal Codes Constructed on Quaternary Filed." In Advances in 3D Image and Graphics Representation, Analysis, Computing and Information Technology. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3867-4_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

"Self-orthogonal codes and projective planes." In Designs, Graphs, Codes and their Links. Cambridge University Press, 1991. http://dx.doi.org/10.1017/cbo9780511623714.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hou, Xiang-dong. "The number of inequivalent binary self-orthogonal codes of dimension 6." In Series on Coding Theory and Cryptology. WORLD SCIENTIFIC, 2007. http://dx.doi.org/10.1142/9789812772022_0014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Self-orthogonal codes"

1

Cardinal, Christian, and Bakitanga-Florian Mvutu. "Coded M-PSK Modulation using Convolutional Self-Doubly Orthogonal Codes." In 2009 IEEE 69th Vehicular Technology Conference Spring. IEEE, 2009. http://dx.doi.org/10.1109/vetecs.2009.5073447.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sysoev, Igor Y., and Ernst M. Gabidulin. "Rank codes using weak self-orthogonal bases." In 2010 IEEE Region 8 International Conference on "Computational Technologies in Electrical and Electronics Engineering" (SIBIRCON 2010). IEEE, 2010. http://dx.doi.org/10.1109/sibircon.2010.5555316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Grassl, M., and M. Rotteler. "Quantum block and convolutional codes from self-orthogonal product codes." In Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523493.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lu, Huimin, Xuedong Dong, Zhenxing Liu, and Meili Zhang. "Quantum Codes Derived from Self-Orthogonal Codes over Large Finite Rings." In 2016 3rd International Conference on Information Science and Control Engineering (ICISCE). IEEE, 2016. http://dx.doi.org/10.1109/icisce.2016.117.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Shulepova, Ekaterina V. "Soft threshold decoding of convolutional self-orthogonal codes." In 2009 International Conference and Seminar on Micro/Nanotechnologies and Electron Devices (EDM). IEEE, 2009. http://dx.doi.org/10.1109/edm.2009.5173970.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mankean, Todsapol, and Somphong Jitman. "Matrix-product constructions for self-orthogonal linear codes." In 2016 12th International Conference on Mathematics, Statistics, and Their Application (ICMSA). IEEE, 2016. http://dx.doi.org/10.1109/icmsa.2016.7954297.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Guo, Luobin, Qiang Fu, Ruihu Li, and Xueliang Li. "On shortening construction of self-orthogonal quaternary codes." In 2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA). IEEE, 2015. http://dx.doi.org/10.1109/iwsda.2015.7458423.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Jin, Lingfei, and Chaoping Xing. "Quantum Gilbert-Varshamov bound through symplectic self-orthogonal codes." In 2011 IEEE International Symposium on Information Theory - ISIT. IEEE, 2011. http://dx.doi.org/10.1109/isit.2011.6034167.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhao, Xuejun, Ruihu Li, and Yingjie Lei. "Classification of Quaternary [21s + 4,3] Optimal Self-orthogonal Codes." In 2009 Sixth International Conference on Information Technology: New Generations. IEEE, 2009. http://dx.doi.org/10.1109/itng.2009.44.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zhao, Xuejun, Ruihu Li, and Yingjie Lei. "Classification of Quaternary [21s+1,3] Optimal Self-orthogonal Codes." In 2009 International Conference on Computer Engineering and Technology (ICCET). IEEE, 2009. http://dx.doi.org/10.1109/iccet.2009.93.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!