Morphological skeleton: Difference between revisions
en>ChrisGualtieri m →References: Remove stub template(s). Page is start class or higher. Also check for and do General Fixes + Checkwiki fixes using AWB |
|||
Line 1: | Line 1: | ||
{{infobox code | |||
| name = Binary Justesen Codes | |||
| image = | |||
| image_caption = | |||
| namesake = Jørn Justesen | |||
| type = [[Linear block code]] | |||
| block_length = <math>n</math> | |||
| message_length = <math>k</math> | |||
| rate = <math>R=k/n</math> | |||
| distance = <math>\delta n</math> where <math>\delta\geq \Big(1-R-\epsilon\Big) H^{-1}_2\big(\frac{1}{2}-\epsilon\big) \sim \frac{1}{2}(1-R-\epsilon)</math> for small <math>\epsilon>0</math>. | |||
| alphabet_size = 2 | |||
| notation = <math>\left[ n, k, \delta n \right]_2</math>-code | |||
| properties = constant rate, constant relative distance, constant alphabet size | |||
}} | |||
In [[coding theory]], '''Justesen codes''' form a class of [[Error detection and correction|error-correcting codes]] that have a constant rate, constant relative distance, and a constant alphabet size. | |||
Before the Justesen code was discovered, no code was known that had all of these three parameters as a constant. | |||
Subsequently, other codes with this property have been discovered, for example [[expander code]]s. | |||
These codes have important applications in [[computer science]] such as in the construction of [[small-bias sample space]]s. | |||
Justesen codes are derived as the [[Concatenated error correction code|code concatenation]] of a [[Reed–Solomon error correction|Reed–Solomon code]] and the [[Wozencraft ensemble]]. | |||
The Reed–Solomon codes used achieve constant rate and constant relative distance at the expense of an alphabet size that is ''linear'' in the message length. | |||
The [[Wozencraft ensemble]] is a family of codes that achieve constant rate and constant alphabet size, but the relative distance is only constant for most of the codes in the family. | |||
The concatenation of the two codes first encodes the message using the Reed–Solomon code, and then encodes each symbol of the codeword further using a code from the [[Wozencraft ensemble]] – using a different code of the ensemble at each position of the codeword. | |||
This is different from usual code concatenation where the inner codes are the same for each position. | |||
The Justesen code can be can constructed very efficiently using only [[logarithmic space]]. | |||
==Definition== | |||
Justesen code is [[Concatenated error correction code|concatenation code]] with different linear inner codes, which is composed of an <math>(N,K,D)_{q^k}</math> outer code <math>C_{out}</math> and different <math>(n,k,d)_q</math> inner codes <math>C_{in}^i</math>, <math>1 \le i \le N</math>. More precisely, the concatenation of these codes, denoted by <math>C_{out} \circ (C_{in}^1 ,...,C_{in}^N )</math>, is defined as follows. Given a message <math>m \in [q^k]^K</math>, we compute the codeword produced by an outer code <math>C_{out}</math>: <math>C_{out}(m) = (c_1,c_2,..,c_N)</math>. Then we apply each code of N linear inner codes to each coordinate of that codeword to produce the final codeword; that is, <math>C_{out} \circ (C_{in}^1,..,C_{in}^N)(m) = (C_{in}^1(c_1),C_{in}^2(c_2),..,C_{in}^n(c_N))</math>. Look back to the definition of the outer code and linear inner codes, this definition of the Justesen code makes sense because the codeword of the outer code is a vector with <math>N</math> elements, and we have <math>N</math> linear inner codes to apply for those <math>N</math> elements. | |||
Here for the Justesen code, the outer code <math>C_{out}</math> is chosen to be [[Reed–Solomon error correction|Reed Solomon code]] over a [[Field (mathematics)|field]] <math>\mathbb{F}_{q^k}</math> evaluated over <math>\mathbb{F}_{q^k}-\{ 0 \}</math> of [[Code rate|rate]] <math>R</math>, <math>0</math> < <math>R</math> < <math>1</math>. The outer code <math>C_{out}</math> have the relative distance <math>\delta_{out} = 1 - R</math> and block length of <math>N = q^k-1</math>. The set of inner codes is the [[Wozencraft ensemble]] <math>\{ C_{in}^\alpha \} _{\alpha \in \mathbb{F}_{q^k }^* }</math>. | |||
==Property of Justesen Code== | |||
As the linear codes in the Wonzencraft ensemble have the rate <math>\frac{1}{2}</math>, Justesen code is the concatenated code <math>C^* = C_{out} \circ (C_{in}^1,C_{in}^2,..,C_{in}^N)</math> with the rate <math>\frac{R}{2}</math>. We have the following theorem that estimates the distance of the concatenated code <math>C^*</math>. | |||
==Theorem== | |||
Let <math>\varepsilon</math> > 0. <math>C^*</math> has relative distance at least <math>(1-R-\varepsilon)H_q^{-1}(\frac{1}{2}-\varepsilon)</math>. | |||
'''''Proof:''''' | |||
The idea of proving that the code <math>C^*</math> has the distance at least <math>(1-R-\varepsilon)H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k \cdot N</math> is to prove that the Hamming distance of two different codewords is at least <math>(1-R-\varepsilon)H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k \cdot N</math>. | |||
Denote <math>\Delta(c^1,c^2)</math> be the Hamming distance of two codewords <math>c^1</math> and <math>c^2</math>. | |||
So for any given <math>m_1</math> and <math>m_2</math> in <math>(\mathbb{F}_{q^k})^K</math> (<math>m_1 \ne m_2</math>), we want to lower bound <math>\Delta(C^*(m_1),C^*(m_2))</math>. | |||
Notice that if <math>C_{out}(m) = (c_1,c_2,..,c_N)</math>, then <math>C^*(m) = (C_{in}^1(c_1),C_{in}^2(c_2),..,C_{in}^N(c_N))</math>. So to the lower bound <math>\Delta(C^*(m_1),C^*(m_2))</math>, we need to take into account the distance of <math>C_{in}^i</math> for i = 1,2,…,N. | |||
Suppose <math>C_{out}(m_1) = (c_1^1,c_2^1,..,c_N^1)</math> and <math>C_{out}(m_2) = (c_1^2,c_2^2,..,c_N^2)</math>. | |||
Recall that <math>\{ C_{in}^i \}_{1 \le i \le N}</math> is a [[Wozencraft ensemble]]. Due to "Wonzencraft ensemble theorem", there are at least <math>(1-\varepsilon)N</math> linear codes <math>C_{in}^i</math> that have distance <math>H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k</math>. | |||
So if for some <math>1 \le i \le N</math>, <math>c_i^1 \ne c_i^2</math> and <math>C_{in}^i</math> code has distance <math>\ge H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k</math>, then <math>\Delta(C_{in}^i(c_i^1),C_{in}^i(c_i^2)) \ge H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k</math>. | |||
Further, if we have <math>T</math> numbers <math>1 \le i \le N</math> such that <math>c_i^1 \ne c_i^2</math> and <math>C_{in}^i</math> code has distance <math>\ge H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k</math>, then <math>\Delta(C^*(m_1),C^*(m_2)) \ge H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k \cdot T</math>. | |||
So now the final task is to lower bound <math>T</math>. | |||
Denote S be the set of all <math>i</math> (<math>1 \le i \le N</math>) such that <math>c_i^1 \ne c_i^2</math>. Then <math>T</math> is the number of linear codes <math>C_{in}^i</math> (<math>i \in S</math>) having the distance <math>H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k</math>. | |||
Now we want to estimate <math>\left| S \right|</math>. Obviously <math>\left| S \right| = \Delta(C_{out}(m_1),C_{out}(m_2)) \ge (1-R)N</math>. | |||
Due to the [[Wozencraft ensemble|Wozencraft Ensemble Theorem]], there are at most <math>\varepsilon N</math> linear codes having distance less than <math>H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k</math>, so <math>T \ge \left| S \right| - \varepsilon N \ge (1-R)N - \varepsilon N = (1-R-\varepsilon)N</math>. | |||
Finally,we have | |||
<math>\Delta(C^*(m_1),C^*(m_2)) \ge H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k \cdot T \ge H_q^{-1}(\frac{1}{2}-\varepsilon) \cdot 2k \cdot (1-R-\varepsilon) \cdot N</math>. | |||
This is true for any arbitrary <math>m_1 \ne m_2</math>. So <math>C^*</math> has the relative distance at least <math>(1-R-\varepsilon)H_q^{-1}(\frac{1}{2}-\varepsilon)</math>, which completes the proof. | |||
==Comments== | |||
We want to consider the "strongly explicit code". So the question is what the "strongly explicit code" is. Loosely speaking, for linear code, the "explicit" property is related to the complexity of constructing its generator matrix G. That means, we can compute the matrix in logarithmic space without using the brute force algorithm to verify that a code has a given satisfied distance. | |||
For the other codes that are not linear, we can consider the complexity of the encoding algorithm. | |||
So by far, we can see that the Wonzencraft ensemble and Reed-Solomon codes are strongly explicit. Therefore we have the following result: | |||
'''''Corollary:''''' The concatenated code <math>C^*</math> is an asymptotically good code(that is, rate <math>R</math> > 0 and relative distance <math>\delta</math> > 0 for small q) and has a strongly explicit construction. | |||
==An example of a Justesen code== | |||
The following slightly different code is referred to as the Justesen code in MacWilliams/MacWilliams. It is the particular case of the above-considered | |||
Justesen code for a very particular Wonzencraft ensemble: | |||
Let ''R'' be a Reed-Solomon code of length ''N'' = 2<sup>''m''</sup> − 1, [[dimension (vector space)|rank]] ''K'' and minimum weight ''N'' − ''K'' + 1. The symbols of ''R'' are elements of ''F'' = GF(2<sup>''m''</sup>) and the codewords are obtained by taking every polynomial ƒ over ''F'' of degree less than ''K'' and listing the values of ƒ on the non-zero elements of ''F'' in some predetermined order. Let α be a [[primitive element (finite field)|primitive element]] of ''F''. For a codeword '''a''' = (''a''<sub>1</sub>, ..., ''a''<sub>''N''</sub>) from ''R'', let '''b''' be the vector of length 2''N'' over ''F'' given by | |||
:<math> \mathbf{b} = \left( a_1, a_1, a_2, \alpha^1 a_2, \ldots, a_N, \alpha^{N-1} a_N \right) </math> | |||
and let '''c''' be the vector of length 2''N'' ''m'' obtained from ''b'' by expressing each element of ''F'' as a binary vector of length ''m''. The ''Justesen code'' is the linear code containing all such '''c'''. | |||
The parameters of this code are length 2''m'' ''N'', dimension ''m'' ''K'' and [[minimum distance]] at least | |||
:<math> \sum_{i=1}^\ell i \binom{2m}{i} , </math> | |||
where <math>\ell</math> is the greatest integer satisfying <math>\sum_{i=1}^\ell \binom{2m}{i}\leq N-K+1</math>. (See MacWilliams/MacWilliams for a proof.) | |||
==See also== | |||
# [[Wozencraft ensemble]] | |||
# [[Concatenated error correction code]] | |||
# [[Reed–Solomon error correction|Reed-Solomon error correction]] | |||
# [[Linear code|Linear Code]] | |||
==References== | |||
# [http://www.cse.buffalo.edu/~atri/courses/coding-theory/ Lecture 28: Justesen Code. Coding theory's course. Prof. Atri Rudra]. | |||
# [http://people.csail.mit.edu/madhu/FT02/ Lecture 6: Concatenated codes. Forney codes. Justesen codes. Essential Coding Theory]. | |||
# {{cite journal | author=J. Justesen | title=A class of constructive asymptotically good algebraic codes | journal=IEEE Trans. Info. Theory | volume=18 | year=1972 | pages=652–656 | doi=10.1109/TIT.1972.1054893 | issue=5 }} | |||
# {{cite book | author=F.J. MacWilliams | authorlink=Jessie MacWilliams | coauthors=N.J.A. Sloane | title=The Theory of Error-Correcting Codes | publisher=North-Holland | year=1977 | isbn=0-444-85193-3 | pages=306–316 }} | |||
[[Category:Error detection and correction]] | |||
[[Category:Finite fields]] | |||
[[Category:Coding theory]] |
Revision as of 03:39, 20 December 2013
Template:Infobox code In coding theory, Justesen codes form a class of error-correcting codes that have a constant rate, constant relative distance, and a constant alphabet size. Before the Justesen code was discovered, no code was known that had all of these three parameters as a constant. Subsequently, other codes with this property have been discovered, for example expander codes. These codes have important applications in computer science such as in the construction of small-bias sample spaces.
Justesen codes are derived as the code concatenation of a Reed–Solomon code and the Wozencraft ensemble. The Reed–Solomon codes used achieve constant rate and constant relative distance at the expense of an alphabet size that is linear in the message length. The Wozencraft ensemble is a family of codes that achieve constant rate and constant alphabet size, but the relative distance is only constant for most of the codes in the family. The concatenation of the two codes first encodes the message using the Reed–Solomon code, and then encodes each symbol of the codeword further using a code from the Wozencraft ensemble – using a different code of the ensemble at each position of the codeword. This is different from usual code concatenation where the inner codes are the same for each position. The Justesen code can be can constructed very efficiently using only logarithmic space.
Definition
Justesen code is concatenation code with different linear inner codes, which is composed of an outer code and different inner codes , . More precisely, the concatenation of these codes, denoted by , is defined as follows. Given a message , we compute the codeword produced by an outer code : . Then we apply each code of N linear inner codes to each coordinate of that codeword to produce the final codeword; that is, . Look back to the definition of the outer code and linear inner codes, this definition of the Justesen code makes sense because the codeword of the outer code is a vector with elements, and we have linear inner codes to apply for those elements.
Here for the Justesen code, the outer code is chosen to be Reed Solomon code over a field evaluated over of rate , < < . The outer code have the relative distance and block length of . The set of inner codes is the Wozencraft ensemble .
Property of Justesen Code
As the linear codes in the Wonzencraft ensemble have the rate , Justesen code is the concatenated code with the rate . We have the following theorem that estimates the distance of the concatenated code .
Theorem
Let > 0. has relative distance at least .
Proof:
The idea of proving that the code has the distance at least is to prove that the Hamming distance of two different codewords is at least .
Denote be the Hamming distance of two codewords and .
So for any given and in (), we want to lower bound .
Notice that if , then . So to the lower bound , we need to take into account the distance of for i = 1,2,…,N.
Recall that is a Wozencraft ensemble. Due to "Wonzencraft ensemble theorem", there are at least linear codes that have distance .
So if for some , and code has distance , then .
Further, if we have numbers such that and code has distance , then .
So now the final task is to lower bound .
Denote S be the set of all () such that . Then is the number of linear codes () having the distance .
Now we want to estimate . Obviously .
Due to the Wozencraft Ensemble Theorem, there are at most linear codes having distance less than , so .
Finally,we have
.
This is true for any arbitrary . So has the relative distance at least , which completes the proof.
Comments
We want to consider the "strongly explicit code". So the question is what the "strongly explicit code" is. Loosely speaking, for linear code, the "explicit" property is related to the complexity of constructing its generator matrix G. That means, we can compute the matrix in logarithmic space without using the brute force algorithm to verify that a code has a given satisfied distance.
For the other codes that are not linear, we can consider the complexity of the encoding algorithm.
So by far, we can see that the Wonzencraft ensemble and Reed-Solomon codes are strongly explicit. Therefore we have the following result:
Corollary: The concatenated code is an asymptotically good code(that is, rate > 0 and relative distance > 0 for small q) and has a strongly explicit construction.
An example of a Justesen code
The following slightly different code is referred to as the Justesen code in MacWilliams/MacWilliams. It is the particular case of the above-considered Justesen code for a very particular Wonzencraft ensemble:
Let R be a Reed-Solomon code of length N = 2m − 1, rank K and minimum weight N − K + 1. The symbols of R are elements of F = GF(2m) and the codewords are obtained by taking every polynomial ƒ over F of degree less than K and listing the values of ƒ on the non-zero elements of F in some predetermined order. Let α be a primitive element of F. For a codeword a = (a1, ..., aN) from R, let b be the vector of length 2N over F given by
and let c be the vector of length 2N m obtained from b by expressing each element of F as a binary vector of length m. The Justesen code is the linear code containing all such c.
The parameters of this code are length 2m N, dimension m K and minimum distance at least
where is the greatest integer satisfying . (See MacWilliams/MacWilliams for a proof.)
See also
References
- Lecture 28: Justesen Code. Coding theory's course. Prof. Atri Rudra.
- Lecture 6: Concatenated codes. Forney codes. Justesen codes. Essential Coding Theory.
- One of the biggest reasons investing in a Singapore new launch is an effective things is as a result of it is doable to be lent massive quantities of money at very low interest rates that you should utilize to purchase it. Then, if property values continue to go up, then you'll get a really high return on funding (ROI). Simply make sure you purchase one of the higher properties, reminiscent of the ones at Fernvale the Riverbank or any Singapore landed property Get Earnings by means of Renting
In its statement, the singapore property listing - website link, government claimed that the majority citizens buying their first residence won't be hurt by the new measures. Some concessions can even be prolonged to chose teams of consumers, similar to married couples with a minimum of one Singaporean partner who are purchasing their second property so long as they intend to promote their first residential property. Lower the LTV limit on housing loans granted by monetary establishments regulated by MAS from 70% to 60% for property purchasers who are individuals with a number of outstanding housing loans on the time of the brand new housing purchase. Singapore Property Measures - 30 August 2010 The most popular seek for the number of bedrooms in Singapore is 4, followed by 2 and three. Lush Acres EC @ Sengkang
Discover out more about real estate funding in the area, together with info on international funding incentives and property possession. Many Singaporeans have been investing in property across the causeway in recent years, attracted by comparatively low prices. However, those who need to exit their investments quickly are likely to face significant challenges when trying to sell their property – and could finally be stuck with a property they can't sell. Career improvement programmes, in-house valuation, auctions and administrative help, venture advertising and marketing, skilled talks and traisning are continuously planned for the sales associates to help them obtain better outcomes for his or her shoppers while at Knight Frank Singapore. No change Present Rules
Extending the tax exemption would help. The exemption, which may be as a lot as $2 million per family, covers individuals who negotiate a principal reduction on their existing mortgage, sell their house short (i.e., for lower than the excellent loans), or take part in a foreclosure course of. An extension of theexemption would seem like a common-sense means to assist stabilize the housing market, but the political turmoil around the fiscal-cliff negotiations means widespread sense could not win out. Home Minority Chief Nancy Pelosi (D-Calif.) believes that the mortgage relief provision will be on the table during the grand-cut price talks, in response to communications director Nadeam Elshami. Buying or promoting of blue mild bulbs is unlawful.
A vendor's stamp duty has been launched on industrial property for the primary time, at rates ranging from 5 per cent to 15 per cent. The Authorities might be trying to reassure the market that they aren't in opposition to foreigners and PRs investing in Singapore's property market. They imposed these measures because of extenuating components available in the market." The sale of new dual-key EC models will even be restricted to multi-generational households only. The models have two separate entrances, permitting grandparents, for example, to dwell separately. The vendor's stamp obligation takes effect right this moment and applies to industrial property and plots which might be offered inside three years of the date of buy. JLL named Best Performing Property Brand for second year running
The data offered is for normal info purposes only and isn't supposed to be personalised investment or monetary advice. Motley Fool Singapore contributor Stanley Lim would not personal shares in any corporations talked about. Singapore private home costs increased by 1.eight% within the fourth quarter of 2012, up from 0.6% within the earlier quarter. Resale prices of government-built HDB residences which are usually bought by Singaporeans, elevated by 2.5%, quarter on quarter, the quickest acquire in five quarters. And industrial property, prices are actually double the levels of three years ago. No withholding tax in the event you sell your property. All your local information regarding vital HDB policies, condominium launches, land growth, commercial property and more
There are various methods to go about discovering the precise property. Some local newspapers (together with the Straits Instances ) have categorised property sections and many local property brokers have websites. Now there are some specifics to consider when buying a 'new launch' rental. Intended use of the unit Every sale begins with 10 p.c low cost for finish of season sale; changes to 20 % discount storewide; follows by additional reduction of fiftyand ends with last discount of 70 % or extra. Typically there is even a warehouse sale or transferring out sale with huge mark-down of costs for stock clearance. Deborah Regulation from Expat Realtor shares her property market update, plus prime rental residences and houses at the moment available to lease Esparina EC @ Sengkang - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534