Trellis Properties of Product Codes(Coding Theory)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we study trellis properties of the tensor product (product code) of two linear codes, and prove that the tensor product of the lexicographically first bases for two linear codes in minimal span form is exactly the lexicographically first basis, for their product code in minimal span form, also the tensor products of characteristic generators of two linear codes are the characteristic generators of their product code.
- 社団法人電子情報通信学会の論文
- 2005-01-01
著者
-
Kan Haibin
The Department Of Computer Science & Engineering Fudan University:graduate School And Informatio
-
Shen Hong
Graduate School And Information Science Japan Advanced Institute Of Science And Technology
関連論文
- A Nonblocking Optical Switching Network for Crosstalk-Free Permutation
- Crosstalk-Free Permutation in Photonic Rearrangeable Networks Built on a Combination of Horizontal Expansion and Vertical Stacking of Banyan Networks(Special Issue on Parallel and Distributed Computing, Applications and technologies)
- A Class of Benes-Based Optical Multistage Interconnection Networks for Crosstalk-Free Realization of Permutations(Fiber-Optic Transmission for Communications)
- Optimal Methods for Proxy Placement in Coordinated En-Route Web Caching(Internet Technology V)
- Optimal Proxy Placement for Coordinated En-Route Transcoding Proxy Caching(Internet Systems)(New Thechnologies and their Applications of the Internet)
- The Bases Associated with Trellises of a Lattice(Coding Theory)
- The Characteristic Generators for a Group Code(Coding Theory)
- Multicasting in Multihop Optical WDM Networks with Limited Wavelength Conversion(Special Invited Survey)
- Optimal parallel weighted multiselection
- Efficient weighted multiselection in parallel architectures
- Trellis Properties of Product Codes(Coding Theory)
- Some Trellis Properties on Lattices(Coding Theory)
- Constructing a Multilayered Boundary to Defend against Intrusive Anomalies(Application Information Security)
- Constructing Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity on an Odd Number of Variables