Space Time Codes from Permutation Codes

نویسنده

  • Oliver Henkel
چکیده

A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. Simulations demonstrate that the performance increases with the block lengths, a result that has been conjectured already in previous work. Further, the connection to permutation codes allows for moderate complex en-/decoding algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of $2times 2$ full diversity space-time codes and inequivalent full rank spaces

‎In wireless communication systems‎, ‎space-time codes are applied to encode data when multiple antennas are used in the receiver and transmitter‎. ‎The concept of diversity is very crucial in designing space-time codes‎. ‎In this paper‎, ‎using the equivalent definition of full diversity space-time codes‎, ‎we first characterize all real and complex $2times 2$ rate one linear dispersion space-...

متن کامل

Genealogical method of urban typo-morphology with the aim of deriving pattern for providing form-based codes

Introduction: The emergence of form-based codes (FBCs), along with the familiar and near-universal rejection of conventional zoning, is a complex story, and more interesting than might first be supposed. The Codes Study generally does not track developer-driven form-based codes. The socio-economic context of form-based codes has shown positive FBC impacts on physical and environmental well-bein...

متن کامل

Partial permutation decoding for binary Hadamard codes

Roland D. Barrolleta – Partial permutation decoding for binary Hadamard codes 1 Johann A. Briffa – Codes for Synchronization Error Correction 2 Wouter Castryck – Some two-torsion issues for curves in characteristic two 4 Gábor Fodor – Fingerprinting codes and their limits 5 E. Suárez-Canedo – About a class of Hadamard Propelinear Codes 6 Andrea Švob – On some transitive combinatorial structures...

متن کامل

Cooperative Orthogonal Space-Time-Frequency Block Codes over a MIMO-OFDM Frequency Selective Channel

In this paper, a cooperative algorithm to improve the orthogonal space-timefrequency block codes (OSTFBC) in frequency selective channels for 2*1, 2*2, 4*1, 4*2 MIMO-OFDM systems, is presented. The algorithm of three node, a source node, a relay node and a destination node is formed, and is implemented in two stages. During the first stage, the destination and the relay antennas receive the sym...

متن کامل

Linear codes with complementary duals related to the complement of the Higman-Sims graph

‎In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7‎, ‎11$ defined by the 3‎- ‎7‎- ‎and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100‎. ‎With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0704.3120  شماره 

صفحات  -

تاریخ انتشار 2006