Paper Abstract and Keywords |
Presentation |
2013-07-26 16:10
A Method for Computing the Minimum Pair Distance of Cyclic Codes Takuya Sugimoto (Kobe Univ.), Masanori Hirotomo (Saga Univ.), Masakatu Morii (Kobe Univ.) IT2013-30 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
Cassuto and Blaum proposed new error correcting codes which are called {it symbol-pair codes}.
They gave a coding framework for channels whose outputs are overlapping pairs of symbols in storage applications.
It is called {it symbol-pair read channel}.
Cassuto and Blaum showed the pair-error correctability defined by the pair distance, and showed lower bounds on the minimum pair distance of cyclic codes.
However it is not reported that results of estimating the minimum pair distance of cyclic codes.
In this paper, we propose a method for computing the minimum pair distance of cyclic codes.
Furthermore, we show comparisons between the minimum pair distance computed by our method and lower bound by Cassuto and Blaum. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
symbol-pair codes / minimum pair distance / pair weight / cyclic codes / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 113, no. 153, IT2013-30, pp. 95-100, July 2013. |
Paper # |
IT2013-30 |
Date of Issue |
2013-07-18 (IT) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
IT2013-30 |
Conference Information |
Committee |
IT |
Conference Date |
2013-07-25 - 2013-07-26 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Nishi-Waseda campus, Waseda University |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
freshman session, general |
Paper Information |
Registration To |
IT |
Conference Code |
2013-07-IT |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
A Method for Computing the Minimum Pair Distance of Cyclic Codes |
Sub Title (in English) |
|
Keyword(1) |
symbol-pair codes |
Keyword(2) |
minimum pair distance |
Keyword(3) |
pair weight |
Keyword(4) |
cyclic codes |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Takuya Sugimoto |
1st Author's Affiliation |
Kobe University (Kobe Univ.) |
2nd Author's Name |
Masanori Hirotomo |
2nd Author's Affiliation |
Saga University (Saga Univ.) |
3rd Author's Name |
Masakatu Morii |
3rd Author's Affiliation |
Kobe University (Kobe Univ.) |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2013-07-26 16:10:00 |
Presentation Time |
25 minutes |
Registration for |
IT |
Paper # |
IT2013-30 |
Volume (vol) |
vol.113 |
Number (no) |
no.153 |
Page |
pp.95-100 |
#Pages |
6 |
Date of Issue |
2013-07-18 (IT) |
|