A decoding algorithm for orthogonal Latin square codes

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 433
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorHahn, Sang-Geunko
dc.contributor.authorKim, DGko
dc.contributor.authorKim, YSko
dc.date.accessioned2013-03-02T17:19:22Z-
dc.date.available2013-03-02T17:19:22Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1997-09-
dc.identifier.citationINDIAN JOURNAL OF PURE APPLIED MATHEMATICS, v.28, no.9, pp.1235 - 1240-
dc.identifier.issn0019-5588-
dc.identifier.urihttp://hdl.handle.net/10203/74691-
dc.description.abstractLet p be an odd prime number. We introduce simple and useful decoding algorithm for the orthogonal Latin square codes of order p. This is bared on the syndrome decoding for linear codes.-
dc.languageEnglish-
dc.publisherINDIAN NAT SCI ACAD-
dc.titleA decoding algorithm for orthogonal Latin square codes-
dc.typeArticle-
dc.identifier.wosid000071545400007-
dc.identifier.scopusid2-s2.0-0031325102-
dc.type.rimsART-
dc.citation.volume28-
dc.citation.issue9-
dc.citation.beginningpage1235-
dc.citation.endingpage1240-
dc.citation.publicationnameINDIAN JOURNAL OF PURE APPLIED MATHEMATICS-
dc.contributor.localauthorHahn, Sang-Geun-
dc.contributor.nonIdAuthorKim, DG-
dc.contributor.nonIdAuthorKim, YS-
dc.type.journalArticleArticle-
dc.subject.keywordAuthordecoding algorithm-
dc.subject.keywordAuthororthogonal-
dc.subject.keywordAuthorLatin square codes-
dc.subject.keywordAuthorhamming weight-
dc.subject.keywordAuthorelements of cardinality-
dc.subject.keywordAuthorparity check matrix-
dc.subject.keywordAuthorsyndrome-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0