|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？9 Q% ?$ d3 T5 F I7 C3 }8 d% g# x
Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity
. v8 u6 `- q( e2 {7 ?$ [Yi Kuang;
8 P5 {& T& `6 V4 z: `* O' q$ ASongsong Li;
0 `+ |" Y! n, }7 f+ p0 qShu Liu;
+ O# v: o s# y& f. |6 WLiming Ma;% i" n7 A" D2 R: O6 q
Chaoping Xing
8 r+ B( P' p. K8 w4 z* G1 AIEEE Transactions on Information Theory
: B$ x6 Z8 j' }- _1 T' @: {! VYear: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE& ~, d& X, C' A
5 Z6 _6 T5 v4 i) I7 h+ ^, }
Abstract# o5 O' z- {" h$ _- Z0 [
HTML
7 C h# u3 I( t8 F7 |+ q6 W
) [ l9 {! S6 D* K, S0 Y' ^# FEncoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)3 ?: B* O9 M7 E" p
Songsong Li;
' m! ]6 i, V, @5 R7 H" |Shu Liu;
7 Y8 ]/ c x2 M. T! eLiming Ma;9 J" h, X+ n5 h. B5 M' [
Yunqi Wan;
3 I0 c3 o7 n9 e6 B8 }3 [Chaoping Xing8 c6 Q; L0 M4 P7 I* ]
IEEE Transactions on Information Theory
* b- i0 U9 Q+ q* UYear: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE0 C" Y. g% E4 o. N) k0 o* k7 o5 N! `
( g; L9 @7 @! @4 ?( M" A* u
Abstract6 \, G9 J9 Q! V" \# s$ y+ n q& n1 t
HTML; u. W+ F. p2 \0 Y
; f' r2 a4 u t0 r
Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy0 I6 T9 u+ w' A) W2 @
Shu Liu;
( Y$ _4 n* _4 M3 l( `7 kIvan Tjuawinata;
6 q& m. I4 o: W& BChaoping Xing
4 z$ J( p1 u, R( B3 Q" JIEEE Transactions on Information Theory" A# M3 C. i5 _, f8 Z
Year: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE5 ^# N2 L" i! P6 w& J5 t
Cited by: Papers (4)' Z+ [5 @# S) w6 V8 C+ G
' {* o& G* Q: e5 A& X) M% z
Abstract
/ T+ h6 {' W6 @# ]8 t' [HTML
( k# ~& S9 P# l0 s% z
) q, _3 u0 v+ \/ MA Lower Bound on the List-Decodability of Insdel Codes. E! i6 P+ P3 @! J
Shu Liu;% A1 Y* [) Z2 v
Ivan Tjuawinata;
% h( ^5 r( d mChaoping Xing
7 ?" d2 d b0 ?2 wIEEE Transactions on Information Theory. Y8 N) H3 ` ]5 Z7 W9 u0 `) r7 p
Year: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE: h5 S5 k" ?! {! I: g+ b2 f1 U2 w! F" {
; h3 q7 h5 ^# S. l
Abstract
9 y7 y4 E0 }( M; U; {& I8 AHTML
- E* [4 Z A9 X3 l
! S v$ r" A) t0 XA New Construction of Nonlinear Codes via Algebraic Function Fields
4 t& Y/ n) O/ BShu Liu;
$ {1 c7 u( a$ ?& d- bLiming Ma;; T& l$ t' T3 i
Ting-Yi Wu;& O: Z- @& J- ~6 \+ [% C
Chaoping Xing
6 i$ n) ]! v1 D& S; Z1 }IEEE Transactions on Information Theory! ]# R, z9 F$ u4 H5 ~/ H* ^3 @
Year: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE
% f$ a) \9 x& i9 i2 w B0 }% R4 T+ FCited by: Papers (1)
! s( N/ x' j* c1 V
5 `2 c1 A, Q) n t4 HAbstract9 Q# D% D4 l6 M8 ?8 s1 q% g
HTML
/ T9 ^0 N% S6 s
! v- s* k* l! _, N4 l- LMaximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
( q- k5 ^; o1 {$ q6 LShu Liu;, p- W# X* ^, Y* ^9 z u# }
Chaoping Xing# H- c! Y3 _) A4 c+ p9 P4 k+ \
IEEE Transactions on Information Theory
9 T3 g" U, R% i2 F( j7 @ B+ J4 aYear: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE
7 _5 D$ y5 n' Q6 }8 ACited by: Papers (2)
8 z3 D0 @% \6 t4 X- D7 r( J) w/ `$ J$ e% N
Abstract
1 S8 A y, ~0 X/ c, ^# X$ qHTML2 g: ~6 g: D! H- F* `
! l& a+ m P0 c( Z) s3 MBounds and Constructions for Insertion and Deletion Codes
& v: o2 ]# C3 p+ h* c% dShu Liu;
5 |$ C& w/ \ E7 @( HChaoping Xing- k( ? y' l: y; D2 v s& n
IEEE Transactions on Information Theory
& v) Q- w# C; E+ t0 y& A8 P( QYear: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE
* J' n* U8 J1 Q% ]1 R: ~2 LCited by: Papers (14)
) E3 v7 |" w6 D2 {, y8 M/ G( I6 `! e2 }3 t5 u$ A
Abstract
h& y4 T; `$ A# `HTML2 V8 l" ~0 h% D; n
& J( ^) U. V! a" s( NEfficiently List-Decodable Insertion and Deletion Codes via Concatenation
) y, ?+ T: H( A( \Shu Liu;" I2 F& Z+ F+ A1 }! m1 l9 P* L
Ivan Tjuawinata;
7 ?5 N& U/ }7 N# H0 L2 RChaoping Xing/ R2 t$ B. d( N3 c
IEEE Transactions on Information Theory+ Z6 E1 O9 j, p) Z, A! w
Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE" J0 O2 f- W# i. P/ ]3 Y
Cited by: Papers (6) t' O9 q& y, n Q1 a
/ E; m& k! [# |) V2 k) LAbstract
: {8 P: W, G1 ]% a0 G+ F* ^; }HTML
+ g- r! C7 u, i; }) ^4 c7 z% b3 }4 |6 a
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
5 H; W% H8 e+ h6 j1 rTai Do Duc;
# _3 F' X; u+ D5 XShu Liu;* A2 X- \8 u1 s2 P Q
Ivan Tjuawinata;8 \) l, M5 t# o+ Z0 }2 y3 Z+ o
Chaoping Xing
9 e5 q3 |; E+ l7 X: A/ |$ hIEEE Transactions on Information Theory( L* r. s4 O3 t. l$ m q
Year: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE
% Y& a, H" x/ Y1 JCited by: Papers (17)4 S. j7 T7 w" N( M: c) D
0 S: ^/ J0 @0 Q% \* t
Abstract q; g* b% @: N! q
HTML
% q- Z7 {% v+ K h ^) `7 w+ V* u7 g- k H: p
List Decodability of Symbol-Pair Codes
, I0 \+ \1 U t& ^6 lShu Liu;
3 H0 p! _" B: i5 L8 L% SChaoping Xing;
- s) j ]) i T* V/ u" ]* {Chen Yuan( x1 e8 A& @ M8 D) L
IEEE Transactions on Information Theory- ?' J8 u. t/ ?" U
Year: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE0 A& D+ X- }* M8 Z; q: O% n
Cited by: Papers (15)
: m% f$ ~6 x3 C
$ u4 g# z5 P4 `+ r- mAbstract
- k- p. k8 e" N7 cHTML% L& a0 ]* k, {; d* h6 n
' T7 c% n! r/ i. i7 yList Decoding of Cover Metric Codes Up to the Singleton Bound
) U0 R8 P1 V$ y# u" D' f8 }5 S+ L$ nShu Liu;
" k3 i6 j& b1 m, I* KChaoping Xing;
. i. s, \. [" ]8 M5 I2 H8 FChen Yuan
0 p& c* U) S% H4 z0 E7 w( n! lIEEE Transactions on Information Theory
: }$ M" P: J5 B( A. f) lYear: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE' e @( b w9 q( m1 `
Cited by: Papers (7)
, R( a7 g4 C6 }2 C Z$ r+ i. F$ n. C$ E: U: \& J o
Abstract
7 a( i" U6 [, X3 Q# w' iHTML
2 g) l* k* [4 H6 h9 X0 v, K; E( ?. S/ ]! l+ R5 @$ `0 J' y
List Decodability of Random Subcodes of Gabidulin Codes1 B5 E4 g" H! G4 y, j' Q( Z
Shu Liu; y+ a. g, G2 K
Chaoping Xing;% k1 Z, R4 h) _% e( O% s
Chen Yuan: Y8 ?; J% X6 S) P6 P+ G0 o
IEEE Transactions on Information Theory
5 a+ T" |2 F. n7 H, u+ MYear: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE
- V+ h1 A9 T( F) w N* k3 u! BCited by: Papers (5)$ {8 Z2 E; f) S; p
|
|
[复制链接]
发表于 2025-12-2 11:45:36
楼主
