2007 IEEE International Symposium on Informationâ€¦

2007

Simple and full-length array LDPC codes (SFA-LDPC codes) is a class of LDPC codes which are algebraically constructed from a family of array codes. The minimum weight of SFA-LDPC codes has beenâ€¦ (More)

A term rewriting system which effectively preserves recognizability (EPR-TRS) has good mathematical properties. In this paper, a new subclass of TRSs, layered transducing TRSs (LT-TRSs) is definedâ€¦ (More)

A number of grammatical formalisms were introduced to define the syntax of natural languages. Among them are parallel multiple context-free grammars (pmcfg's) and lexical-functional grammars (lfg's).â€¦ (More)

New algorithms for the soft-decision and the hard-decision maximum likelihood decoding (MLD) for binary linear block codes are proposed. It has been widely known that both MLD can be regarded as anâ€¦ (More)

It is a well-known theorem by Chomsky and SchÃ¼tzenberger (1963) that every context-free language can be represented as a homomorphic image of the intersection of a Dyck language and a regularâ€¦ (More)

With slice-based flash code, the smaller the size slice the more flexible it is to distribute cells among the bits and leave less unused levels. However, smaller size slices comes with a smallâ€¦ (More)

An algorithm for encoding low-density parity check (LDPC) codes is investigated. The algorithm computes parity check symbols by solving a set of sparse equations, and the triangular factorization isâ€¦ (More)

The expected write deficiency of the index-less indexed flash codes (ILIFC) is studied, and a technique is developed to improve the write deficiency of ILIFC. ILIFC is a coding scheme for flashâ€¦ (More)