(?1b?, ?2b?, ?3b?) Linear Codes Over GF(2)

dc.contributor.author	Tyagi, Vinod
dc.contributor.author	Sethi, Amita
dc.date.accessioned	2015-04-08T12:51:27Z
dc.date.available	2015-04-08T12:51:27Z
dc.date.issued	2009
dc.department	İstanbul Beykent Üniversitesi	en_US
dc.description.abstract	This paper explores the possibilities of the existence of block-wise burst error correcting (n,k) linear codes over GF(2) (Galois field of two elements ,0 and 1) that can correct all bursts of length b? (fixed) in the first n? components , all bursts of length b? (fixed) in the next n? components and all bursts of length b? (fixed) in the last n? components; n = n1+ n2 +n3. Such codes are named as (?1b?, ?2b?, ?3b?) linear codes. Some of these codes turn out to be byte oriented[7].	en_US
dc.identifier.citation	Journal of Science and Technology 3 (2), 2009, 301 – 319	tr_TR
dc.identifier.issn	1307-3818
dc.language.iso	en	en_US
dc.publisher	Beykent Üniversitesi	tr_TR
dc.relation.publicationcategory	Makale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanı	en_US
dc.subject	(ⁿ1b₁, ⁿ2b₂, ⁿ3b₃) code	tr_TR
dc.subject	burst of length b(fixed)	tr_TR
dc.subject	parity check matrix	tr_TR
dc.subject	error pattern syndrome- table	tr_TR
dc.subject	byte oriented codes	tr_TR
dc.title	(?1b?, ?2b?, ?3b?) Linear Codes Over GF(2)	en_US
dc.type	Article	en_US