Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2010-03-05 13:25
Constructions of A Large Class of Optimum Linear Codes for Small Number of Information Symbols
Masao Kasahara (Osaka Gakuin Univ.), Shigeichi Hirasawa (Waseda Univ.) IT2009-137 ISEC2009-145 WBS2009-116
Abstract (in Japanese) (See Japanese page) 
(in English) We show that these codes meet the bound of linear codes $(m \leq 6)$ due to Brouwer and Verhoeff.
It is strongly conjectured that, for $m > 6$,
our codes meet the bound for any code-length.
We then present the $(n, 2, d)$ codes that meet the bound of any linear code of length $n \leq 126$.
It is strongly conjectured that the proposed $(n, 2, d)$ codes meet the bound of optimum linear code of any code length.
We also present the $(n, 3, d)$ code that meet the bound of any linear code
of length n except $n = 8 + 7 \mu$ for $n \leq 126$.
It is strongly conjectured that our $(n, 3, d)$ code meet the bound for any code length except $m = 8 + 7 \mu (\mu = 1, 2, \cdots)$.
Finally we present several optimum linear codes for the number of information symbols $k=4,5,6$ and 7.
Keyword (in Japanese) (See Japanese page) 
(in English) Efficient code / Binary linear code / Minimum distance bound / (u,u+v) construction / / / /  
Reference Info. IEICE Tech. Rep., vol. 109, no. 444, IT2009-137, pp. 419-426, March 2010.
Paper # IT2009-137 
Date of Issue 2010-02-25 (IT, ISEC, WBS) 
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 IT2009-137 ISEC2009-145 WBS2009-116

Conference Information
Committee IT ISEC WBS  
Conference Date 2010-03-04 - 2010-03-05 
Place (in Japanese) (See Japanese page) 
Place (in English) Nagano-Engineering Campus, Shinshu University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To IT 
Conference Code 2010-03-IT-ISEC-WBS 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Constructions of A Large Class of Optimum Linear Codes for Small Number of Information Symbols 
Sub Title (in English)  
Keyword(1) Efficient code  
Keyword(2) Binary linear code  
Keyword(3) Minimum distance bound  
Keyword(4) (u,u+v) construction  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Masao Kasahara  
1st Author's Affiliation Osaka Gakuin University (Osaka Gakuin Univ.)
2nd Author's Name Shigeichi Hirasawa  
2nd Author's Affiliation Waseda University (Waseda Univ.)
3rd Author's Name  
3rd Author's Affiliation ()
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2010-03-05 13:25:00 
Presentation Time 25 minutes 
Registration for IT 
Paper # IT2009-137, ISEC2009-145, WBS2009-116 
Volume (vol) vol.109 
Number (no) no.444(IT), no.445(ISEC), no.446(WBS) 
Page pp.419-426 
#Pages 8 
Date of Issue 2010-02-25 (IT, ISEC, WBS) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan