Construction of New Codes from Given Ones in an Additive Channel - Journal of Information Security

JIS > Vol.7 No.3, April 2016

Construction of New Codes from Given Ones in an Additive Channel ()

HTML XML

Download as PDF (Size: 273KB) PP. 165-171

DOI: 10.4236/jis.2016.73012 2,394 Downloads 2,978 Views

Author(s)

Garib Movsisyan

Affiliation(s)

BIT Group, Moscow, Russia.

ABSTRACT

In the present work, a construction making possible creation of an additive channel

of cardinality s and rank r for arbitrary integers s, r, n (r≤min (n,s-1)), as well as creation of a code

correcting errors of the channel A is presented.

KEYWORDS

Additive Channel, Golay Code, Classical Coding Theory, T-Order Neighborhood, Correcting Code, Binary Alphabet, Cardinality

Share and Cite:

Movsisyan, G. (2016) Construction of New Codes from Given Ones in an Additive Channel. Journal of Information Security, 7, 165-171. doi: 10.4236/jis.2016.73012.

Journals Menu

Articles
Archive
Indexing
Aims & Scope
Editorial Board
For Authors
Publication Fees

Journals Menu

Articles
Archive
Indexing
Aims & Scope
Editorial Board
For Authors
Publication Fees

Open Special Issues
Published Special Issues
Special Issues Guideline

E-Mail Alert
JIS Subscription
Publication Ethics & OA Statement
Frequently Asked Questions
Recommend to Peers
Recommend to Library
Contact us
Disclaimer
History Issue

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies