<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Isfahan</PublisherName>
				<JournalTitle>Transactions on Combinatorics</JournalTitle>
				<Issn>2251-8657</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2015</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Linear codes on solid bursts and random errors</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>45</FirstPage>
			<LastPage>55</LastPage>
			<ELocationID EIdType="pii">6189</ELocationID>
			
<ELocationID EIdType="doi">10.22108/toc.2015.6189</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Pankaj Kumar</FirstName>
					<LastName>Das</LastName>
<Affiliation>Shivaji College (University of Delhi)</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>12</Month>
					<Day>26</Day>
				</PubDate>
			</History>
		<Abstract>‎The paper presents lower and upper bounds on the number of parity check digits required for a linear code that detects solid bursts of length $b$ or less and simultaneously any $e$ or less random errors‎. ‎An example of such a code is also provided‎. ‎Further‎, ‎codes capable of detecting and simultaneously correcting such errors have also been dealt with‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Parity check matrix</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">syndrome</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">solid burst error</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://toc.ui.ac.ir/article_6189_9619dd1f0360d22b7a321782e90bd715.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
