@article{DDCj08,
 abstract = {This paper introduces the problem of diversity embedded codes for inter-symbol
interference (ISI) channels and gives algebraic constructions for them. These constructions
are based on designing binary rank-distance codes with a specific (Toeplitz-like) constraint
and lifting them to the complex domain through set-partitioning maps. As a special case
these algebraic constructions also give rate-diversity optimal codes for transmission over
ISI channels when there are transmit alphabet constraints.},
 author = {S. Dusad and S N. Diggavi and A R. Calderbank},
 file = {:papers:ddcfinalrankdist.pdf},
 journal = {IEEE Transactions on Information Theory},
 month = {November},
 note = {},
 number = {11},
 pages = {4866--4886},
 tags = {journal,DivEmb,OppComm,RankDistCod,CodTh,STcodes},
 title = {Embedded Rank Distance Codes for ISI channels},
 type = {2},
 url_arxiv = {http://arxiv.org/abs/0707.4311},
 volume = {54},
 year = {2008}
}

{"_id":"nvAEvuEdSFD2sejr8","bibbaseid":"dusad-diggavi-calderbank-embeddedrankdistancecodesforisichannels-2008","author_short":["Dusad, S.","Diggavi, S N.","Calderbank, A R."],"bibdata":{"bibtype":"article","type":"2","abstract":"This paper introduces the problem of diversity embedded codes for inter-symbol interference (ISI) channels and gives algebraic constructions for them. These constructions are based on designing binary rank-distance codes with a specific (Toeplitz-like) constraint and lifting them to the complex domain through set-partitioning maps. As a special case these algebraic constructions also give rate-diversity optimal codes for transmission over ISI channels when there are transmit alphabet constraints.","author":[{"firstnames":["S."],"propositions":[],"lastnames":["Dusad"],"suffixes":[]},{"firstnames":["S","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]},{"firstnames":["A","R."],"propositions":[],"lastnames":["Calderbank"],"suffixes":[]}],"file":":papers:ddcfinalrankdist.pdf","journal":"IEEE Transactions on Information Theory","month":"November","note":"","number":"11","pages":"4866–4886","tags":"journal,DivEmb,OppComm,RankDistCod,CodTh,STcodes","title":"Embedded Rank Distance Codes for ISI channels","url_arxiv":"http://arxiv.org/abs/0707.4311","volume":"54","year":"2008","bibtex":"@article{DDCj08,\n abstract = {This paper introduces the problem of diversity embedded codes for inter-symbol\ninterference (ISI) channels and gives algebraic constructions for them. These constructions\nare based on designing binary rank-distance codes with a specific (Toeplitz-like) constraint\nand lifting them to the complex domain through set-partitioning maps. As a special case\nthese algebraic constructions also give rate-diversity optimal codes for transmission over\nISI channels when there are transmit alphabet constraints.},\n author = {S. Dusad and S N. Diggavi and A R. Calderbank},\n file = {:papers:ddcfinalrankdist.pdf},\n journal = {IEEE Transactions on Information Theory},\n month = {November},\n note = {},\n number = {11},\n pages = {4866--4886},\n tags = {journal,DivEmb,OppComm,RankDistCod,CodTh,STcodes},\n title = {Embedded Rank Distance Codes for ISI channels},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0707.4311},\n volume = {54},\n year = {2008}\n}\n\n","author_short":["Dusad, S.","Diggavi, S N.","Calderbank, A R."],"key":"DDCj08","id":"DDCj08","bibbaseid":"dusad-diggavi-calderbank-embeddedrankdistancecodesforisichannels-2008","role":"author","urls":{" arxiv":"http://arxiv.org/abs/0707.4311"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["embedded","rank","distance","codes","isi","channels","dusad","diggavi","calderbank"],"title":"Embedded Rank Distance Codes for ISI channels","year":2008}