Search results for "free distance"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Joan-Josep Climent, Victoria Herranz, Carmen Perea, Virtudes Tomás	A Systems Theory Approach to Periodically Time-Varying Convolutional Codes by Means of Their Invariant Equivalent.	AAECC	2009	DBLP DOI BibTeX RDF	Time-varying convolutional codes, free distance, controllability, observability
2	Kristine Lally	Algebraic lower bounds on the free distance of convolutional codes.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
1	Hassan Hijazi, Amadou Diallo, Michel Kieffer, Leo Liberti, Claudio Weidmann	A MILP Approach for Designing Robust Variable-Length Codes Based on Exact Free Distance Computation.	DCC	2012	DBLP DOI BibTeX RDF
1	Amadou Diallo, Claudio Weidmann, Michel Kieffer	Efficient Computation and Optimization of the Free Distance of Variable-Length Finite-State Joint Source-Channel Codes.	IEEE Transactions on Communications	2011	DBLP DOI BibTeX RDF
1	David G. M. Mitchell, Ali Emre Pusane, Michael Lentmaier, Daniel J. Costello Jr.	Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes	CoRR	2011	DBLP BibTeX RDF
1	David G. M. Mitchell, Ali Emre Pusane, Michael Lentmaier, Daniel J. Costello Jr.	Exact free distance and trapping set growth rates for LDPC convolutional codes.	ISIT	2011	DBLP DOI BibTeX RDF
1	Konstantin Kondrashov, Victor V. Zyablov	On the lower bound of the free distance of partial unit memory codes based on LDPC Codes.	ISIT	2011	DBLP DOI BibTeX RDF
1	Florian Hug, Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov	A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120.	IEEE Transactions on Information Theory	2010	DBLP DOI BibTeX RDF
1	Amadou Diallo, Claudio Weidmann, Michel Kieffer	Optimizing the free distance of Error-Correcting Variable-Length Codes.	MMSP	2010	DBLP DOI BibTeX RDF
1	Yeh-jong Pan, Chih-wen Weng	A note on triangle-free distance-regular graphs with a2!=0.	J. Comb. Theory, Ser. B	2009	DBLP DOI BibTeX RDF
1	Pavel Krömer, Václav Snásel, Jan Platos, Nabil Ouddane	On turbo code interleavers optimized by bit error rate evolution and free distance evolution.	ICUMT	2009	DBLP DOI BibTeX RDF
1	Sina Vafi	Free distance computation of turbo BCH codes.	PIMRC	2009	DBLP DOI BibTeX RDF
1	Yu Cao, Xiupeng Chen, Yang Yu, Guixia Kang	Range-free Distance Estimate Methods using Neighbor Information in Wireless Sensor Networks.	VTC Fall	2009	DBLP DOI BibTeX RDF
1	Jos Akhtman, Nicholas Bonello, Robert G. Maunder, Lajos Hanzo	Closed-Form Approximation of the Coding-Rate Versus Free Distance Trade-Off.	VTC Fall	2009	DBLP BibTeX RDF
1	Li Li, Thomas Kunz	Cooperative node localization using nonlinear data projection.	TOSN	2009	DBLP DOI BibTeX RDF	curvilinear component analysis, simulations, Localization, multi-dimensional scaling, nonlinear mapping
1	Mostafa Esmaeili, Mehdi Gholami	Geometrically-structured maximum-girth LDPC block and convolutional codes.	IEEE Journal on Selected Areas in Communications	2009	DBLP DOI BibTeX RDF
1	Yeh-jong Pan, Chih-wen Weng	3-bounded property in a triangle-free distance-regular graph.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
1	Aleksandar Jurisic, Jack H. Koolen, Arjana Zitnik	Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
1	Kris Coolsaet, Aleksandar Jurisic, Jack H. Koolen	On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
1	David G. M. Mitchell, Ali Emre Pusane, Norbert Goertz, Daniel J. Costello Jr.	Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes	CoRR	2008	DBLP BibTeX RDF
1	Nabil Ouddane, Pavel Krömer, Václav Snásel, Jan Platos	Optimizing Turbo Codes Free distance Computation Garello's method by Genetic Algorithms.	GEM	2008	DBLP BibTeX RDF
1	Bernhard Haubold, Mirjana Domazet-Loso, Thomas Wiehe	An Alignment-Free Distance Measure for Closely Related Genomes.	RECOMB-CG	2008	DBLP DOI BibTeX RDF
1	Václav Snásel, Jan Platos, Pavel Krömer, Nabil Ouddane	Genetic Algorithms for Better Turbo Codes.	DEXA Workshops	2008	DBLP DOI BibTeX RDF	interleaver optimization, genetic algorithms, turbo code
1	Freddy López Villafuerte, Kirsten Terfloth, Jochen H. Schiller	Using Network Density as a New Parameter to Estimate Distance.	ICN	2008	DBLP DOI BibTeX RDF	Algorithm, Localization, Distance, Density
1	Anh Quang Pham, Lie-Liang Yang, Noor S. Othman, Lajos Hanzo	EXIT-Chart Optimized Block Codes for Wireless Video Telephony.	IEEE Trans. Circuits Syst. Video Techn.	2008	DBLP DOI BibTeX RDF
1	Axel Huebner, Kamil Sh. Zigangirov, Daniel J. Costello Jr.	Laminated Turbo Codes: A New Class of Block-Convolutional Codes.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
1	Santosh Nagaraj	Generalized BICM for Block Fading Channels.	IEEE Transactions on Wireless Communications	2008	DBLP DOI BibTeX RDF
1	Patrick Solé, Virgilio Sison	Quaternary Convolutional Codes From Linear Block Codes Over Galois Rings.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
1	Arvind Sridharan, Dmitri V. Truhachev, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov	Distance Bounds for an Ensemble of LDPC Convolutional Codes.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
1	Sarah Jane Delany, Derek G. Bridge	Catching the Drift: Using Feature-Free Case-Based Reasoning for Spam Filtering.	ICCBR	2007	DBLP DOI BibTeX RDF
1	Vidhyacharan Bhaskar	Soft-Decision Decoding of Punctured Convolutional Codes in Asynchronous-CDMA Communications Under Perfect Phase-Tracking Conditions.	IJWIN	2006	DBLP DOI BibTeX RDF	Punctured convolutional codes, perfect phase tracking, minimum free distance, soft-decision decoding
1	Francesco Chiti, Romano Fantacci, Dania Marabissi, L. Innocenti, Hsiao-Hwa Chen, Mohsen Guizani	Punctured hopping CDMA techniques: fundamentals and application to UWB communications.	IEEE Journal on Selected Areas in Communications	2006	DBLP DOI BibTeX RDF
1	Heide Gluesing-Luerssen, Joachim Rosenthal, Roxana Smarandache	Strongly-MDS convolutional codes.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
1	V. Pavlushkov, Rolf Johannesson, Victor V. Zyablov	Unequal error protection for convolutional codes.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
1	Alberto Perotti, Sergio Benedetto	An Upper Bound on the Minimum Distance of Serially Concatenated Convolutional Codes.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
1	Zhiquan Bai, Shaoyi Xu, Weihua Zhang, Kyungsup Kwak	Performance Analysis of DS-BPAM UWB System over Fading Channels - Uncoded and Coded Schemes.	EUC	2006	DBLP DOI BibTeX RDF	Direct sequence (DS), Soft Output Viterbi algorithm (SOVA), Multipath fading channel, SRake receiver, Ultra wideband (UWB), Convolutional codes
1	Aleksandar Jurisic, Jack H. Koolen, Stefko Miklavic	Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency.	J. Comb. Theory, Ser. B	2005	DBLP DOI BibTeX RDF
1	Adrish Banerjee, Francesca Vatta, Bartolo Scanavino, Daniel J. Costello Jr.	Nonsystematic turbo codes.	IEEE Transactions on Communications	2005	DBLP DOI BibTeX RDF
1	Ragnar Thobaben, Jörg Kliewer	Low-complexity iterative joint source-channel decoding for variable-length encoded Markov sources.	IEEE Transactions on Communications	2005	DBLP DOI BibTeX RDF
1	Jian-Kang Zhang, Aleksandar Kavcic, Kon Max Wong	Equal-diagonal QR decomposition and its application to precoder design for successive-cancellation detection.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
1	Faramarz Fekri, Mina Sartipi, Russell M. Mersereau, Ronald W. Schafer	Convolutional codes using finite-field wavelets: time-varying codes and more.	IEEE Transactions on Signal Processing	2005	DBLP DOI BibTeX RDF
1	Wook-Hyun Jeong, Young-Suk Yoon, Yo-Sung Ho	Design of robust reversible variable-length codes using the property of free distance.	ICME	2004	DBLP BibTeX RDF
1	Sina Vafi, Tadeusz A. Wysocki	Computation of the free distance and low weight distribution of turbo codes with convolutional interleavers.	PIMRC	2004	DBLP DOI BibTeX RDF
1	Srinivasan Parthasarathy 0002, Rajiv Gandhi	Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks.	FSTTCS	2004	DBLP DOI BibTeX RDF
1	Lina Fagoonee, Bahram Honary	A Multifunctional Turbo-Based Receiver Using Partial Unit Memory Codes.	IMA Int. Conf.	2003	DBLP DOI BibTeX RDF
1	Eirik Rosnes, Øyvind Ytrehus	High Rate Convolutional Codes with Optimal Cycle Weights.	IMA Int. Conf.	2003	DBLP DOI BibTeX RDF
1	Tuncay Ertas	Upper bounds on the free distance for a class of convolutional coded CPFSK signals.	IEEE Communications Letters	2001	DBLP DOI BibTeX RDF
1	Roberto Garello, Paola Pierleoni, Sergio Benedetto	Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications.	IEEE Journal on Selected Areas in Communications	2001	DBLP DOI BibTeX RDF
1	Pål K. Frenger, Pål Orten, Tony Ottosson	Code-spread CDMA using maximum free distance low-rate convolutional codes.	IEEE Transactions on Communications	2000	DBLP DOI BibTeX RDF
1	Karin Engdahl, Michael Lentmaier, Kamil Sh. Zigangirov	On the Theory of Low-Density Convolutional Codes.	AAECC	1999	DBLP DOI BibTeX RDF
1	Joachim Rosenthal, Roxana Smarandache	Maximum Distance Separable Convolutional Codes.	Appl. Algebra Eng. Commun. Comput.	1999	DBLP DOI BibTeX RDF	MDS block codes, Convolutional codes
1	Yuh-jeng Liang, Chih-Wen Weng	Parallelogram-Free Distance-Regular Graphs.	J. Comb. Theory, Ser. B	1997	DBLP DOI BibTeX RDF
1	Victor V. Zyablov, Vladimir Sidorenko	On Periodic (Partial) Unit Memory Codes with Maximum Free Distance.	Error Control, Cryptology, and Speech Compression	1993	DBLP DOI BibTeX RDF
1	Vladimir V. Chepyzhov, Ben J. M. Smeets, Kamil Sh. Zigangirov	The free distance of fixed convolutional rate 2/4 codes meets the Costello bound.	IEEE Transactions on Information Theory	1992	DBLP DOI BibTeX RDF
1	Ryuji Kohno, Choonsik Yim, Hideki Imai	Trellis Coded Modulation Based on Time-Varying Mapping and Encoders for Utilitzing a Channel Intersymbol Interference.	AAECC	1990	DBLP DOI BibTeX RDF
1	Jørn M. Jensen	Bounds on the free distance of systematic convolutional codes.	IEEE Transactions on Information Theory	1988	DBLP DOI BibTeX RDF
1	Gregory J. Pottie, Desmond P. Taylor	Sphere-packing upper bounds on the free distance of trellis codes.	IEEE Transactions on Information Theory	1988	DBLP DOI BibTeX RDF
1	Philippe Piret	A Conjecture on the Free Distance of (2, 1m) Binary Convolutional Codes.	AAECC	1987	DBLP BibTeX RDF
1	Wieger J. Reitsema	A lower bound on the free distance of convolutional codes related to cyclic codes.	IEEE Transactions on Information Theory	1981	DBLP DOI BibTeX RDF
1	Roger L. Peterson, Daniel J. Costello Jr.	Error probability and free distance bounds for two-user tree codes on multiple-access channels.	IEEE Transactions on Information Theory	1980	DBLP DOI BibTeX RDF
1	Lin-nan Lee	Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.).	IEEE Transactions on Information Theory	1976	DBLP DOI BibTeX RDF