TAILIEUCHUNG - Báo cáo toán học: "Ternary Constant Weight Codes"

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí toán học quốc tế đề tài: Ternary Constant Weight Codes | Ternary Constant Weight Codes Patric R. J. Ostergảrd Department of Computer Science and Engineering Helsinki University of Technology . Box 5400 02015 HUT Finland Mattias Svanstrom Department of Electrical Engineering Linkopings universitet 581 83 Linkoping Sweden mattias@ Submitted October 1 2002 Accepted October 15 2002. MR Subject Classifications 94B25 05B40 Abstract Let A3 n d w denote the maximum cardinality of a ternary code with length n minimum distance d and constant Hamming weight w. Methods for proving upper and lower bounds on A3 n d w are presented and a table of exact values and bounds in the range n 10 is given. Keywords bounds on codes constant weight code error-correcting code ternary code. 1 Introduction Constant weight codes constitute an important class of error-correcting codes 17 . Binary constant weight codes have therefore been thoroughly studied with the focus of attention on the function A n d w which denotes the maximum cardinality of a binary code of length n minimum distance d and constant weight w. Extensive results on upper and lower bounds on A n d w are presented in 1 and 7 respectively. Supported in part by the Academy of Finland under grant 100500. 1 Supported by the Swedish Research Council for Engineering Sciences under grant 271-97-532. When studying nonbinary constant weight codes one may either prescribe the complete weight or the Hamming weight of the codes. Codes with given complete weight are called constant-composition codes. Ternary constant-composition codes are studied in 25 . The maximum size of a ternary code with minimum distance d and complete weight enumerator of the form AW0W1W2zW zW1 zW so n w0 w1 w2 where AW0 W1 W2 is the number of codewords with the given composition is denoted by A3 n d w0 w1 w2 . In this paper we study ternary codes with given Hamming weight and let Aq n d w denote the maximum size of a q-ary code of length n minimum distance d and constant Hamming weight

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.